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 …

Publisher Summary The traveling salesman problem, TSP for short, has model character in
many branches of mathematics, computer science, and operations research. Heuristics …

Combinatorial optimization problems are typically tackled by the branch-and-bound
paradigm. We propose a new graph convolutional neural network model for learning branch …

Abstract A recent Graph Neural Network (GNN) approach for learning to branch has been
shown to successfully reduce the running time of branch-and-bound algorithms for Mixed …

Swarm intelligence is a relatively new approach to problem solving that takes inspiration
from the social behaviors of insects and of other animals. In particular, ants have inspired a …

Abstract Machine learning (ML) has been recently introduced to solving optimization
problems, especially for combinatorial optimization (CO) tasks. In this paper, we survey the …

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

This paper describes an implementation of the Lin–Kernighan heuristic, one of the most
successful methods for generating optimal or near-optimal solutions for the symmetric …

No pleasure lasts long unless there is variety in it. Publilius Syrus, Moral Sayings We've
been very fortunate to receive fantastic feedback from our readers during the last four years …

8 The traveling salesman problem: a case study Page 1 8 The traveling salesman problem: a
case study David S. Johnson AT& T Labs-Research, Florham Park Lyle A. McGeoch Amherst …