The branch-and-bound (B&B) algorithmic framework has been used successfully to find
exact solutions for a wide array of optimization problems. B&B uses a tree search strategy to …

This paper reviews some of the most intriguing results and questions related to Lagrangean
relaxation. It recalls essential properties of the Lagrangean relaxation and of the …

Task allocation is an important aspect of many multi-robot systems. The features and
complexity of multi-robot task allocation (MRTA) problems are dictated by the requirements …

A PRACTICAL GUIDE TO OPTIMIZATION PROBLEMS WITH DISCRETE OR INTEGER
VARIABLES, REVISED AND UPDATED The revised second edition of Integer Programming …

We discuss formulations of integer programs with a huge number of variables and their
solution by column generation methods, ie, implicit pricing of nonbasic variables to generate …

Dantzig-Wolfe decomposition and column generation, devised for linear programs, is a
success story in large-scale integer programming. We outline and relate the approaches …

In this article, we study the reinforcement learning (RL) for vehicle routing problems (VRPs).
Recent works have shown that attention-based RL models outperform recurrent neural …

An accessible treatment of the modeling and solution of integer programming problems,
featuring modern applications and software In order to fully comprehend the algorithms …

Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

The application of optimization techniques to home care service planning has received
increasing attention, as more patients are in need of dedicated care. Currently, the problem …