Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning
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 …
exact solutions for a wide array of optimization problems. B&B uses a tree search strategy to …
Physics-inspired optimization for quadratic unconstrained problems using a digital annealer
The Fujitsu Digital Annealer is designed to solve fully connected quadratic unconstrained
binary optimization (QUBO) problems. It is implemented on application-specific CMOS …
binary optimization (QUBO) problems. It is implemented on application-specific CMOS …
[PDF][PDF] Metaheuristics: From Design to Implementation
EG Talbi - John Wiley & Sons google schola, 2009 - zeus.inf.ucv.cl
A unified view of metaheuristics This book provides a complete background on
metaheuristics and shows readers how to design and implement efficient algorithms to solve …
metaheuristics and shows readers how to design and implement efficient algorithms to solve …
[LIVRE][B] Integer programming
LA Wolsey - 2020 - books.google.com
A PRACTICAL GUIDE TO OPTIMIZATION PROBLEMS WITH DISCRETE OR INTEGER
VARIABLES, REVISED AND UPDATED The revised second edition of Integer Programming …
VARIABLES, REVISED AND UPDATED The revised second edition of Integer Programming …
[LIVRE][B] Geometry of cuts and metrics
Cuts and metrics are well-known objects that arise-independently, but with many deep and
fascinating connections-in diverse fields: in graph theory, combinatorial optimization …
fascinating connections-in diverse fields: in graph theory, combinatorial optimization …
[PDF][PDF] Branch-and-cut algorithms for combinatorial optimization problems
JE Mitchell - Handbook of applied optimization, 2002 - homes.di.unimi.it
Branch-and-cut methods are very successful techniques for solving a wide variety of integer
programming problems, and they can provide a guarantee of optimality. We describe how a …
programming problems, and they can provide a guarantee of optimality. We describe how a …
[LIVRE][B] Algorithms and theory of computation handbook, volume 2: special topics and techniques
MJ Atallah, M Blanton - 2009 - books.google.com
This handbook provides an up-to-date compendium of fundamental computer science
topics, techniques, and applications. Along with updating and revising many of the existing …
topics, techniques, and applications. Along with updating and revising many of the existing …
[HTML][HTML] Cutting planes in integer and mixed integer programming
This survey presents cutting planes that are useful or potentially useful in solving mixed
integer programs. Valid inequalities for (i) general integer programs,(ii) problems with local …
integer programs. Valid inequalities for (i) general integer programs,(ii) problems with local …
Separating capacity constraints in the CVRP using tabu search
P Augerat, JM Belenguer, E Benavent… - European Journal of …, 1998 - Elsevier
Branch and Cut methods have shown to be very successful in the resolution of some hard
combinatorial optimization problems. The success has been remarkable for the Symmetric …
combinatorial optimization problems. The success has been remarkable for the Symmetric …
Combining metaheuristics with mathematical programming, constraint programming and machine learning
EG Talbi - Annals of Operations Research, 2016 - Springer
During the last years, interest on hybrid metaheuristics has risen considerably in the field of
optimization and machine learning. The best results found for many optimization problems in …
optimization and machine learning. The best results found for many optimization problems in …