Mathematical optimization approaches for facility layout problems: The state-of-the-art and future research directions
Facility layout problems are an important class of operations research problems that has
been studied for several decades. Most variants of facility layout are NP-hard, therefore …
been studied for several decades. Most variants of facility layout are NP-hard, therefore …
Symmetry in integer linear programming
F Margot - 50 Years of Integer Programming 1958-2008: From the …, 2009 - Springer
An integer linear program (ILP) is symmetric if its variables can be permuted without
changing the structure of the problem. Areas where symmetric ILPs arise range from applied …
changing the structure of the problem. Areas where symmetric ILPs arise range from applied …
The SCIP optimization suite 8.0
The SCIP Optimization Suite provides a collection of software packages for mathematical
optimization centered around the constraint integer programming framework SCIP. This …
optimization centered around the constraint integer programming framework SCIP. This …
[PDF][PDF] The SCIP optimization suite 7.0
G Gamrath, D Anderson, K Bestuzheva, WK Chen… - 2020 - opus4.kobv.de
The SCIP Optimization Suite provides a collection of software packages for mathematical
optimization centered around the constraint integer programming frame-work SCIP. This …
optimization centered around the constraint integer programming frame-work SCIP. This …
The SCIP optimization suite 5.0
A Gleixner, L Eifler, T Gally, G Gamrath, P Gemander… - 2017 - opus4.kobv.de
This article describes new features and enhanced algorithms made available in version 5.0
of the SCIP Optimization Suite. In its central component, the constraint integer programming …
of the SCIP Optimization Suite. In its central component, the constraint integer programming …
The SCIP optimization suite 9.0
The SCIP Optimization Suite provides a collection of software packages for mathematical
optimization, centered around the constraint integer programming (CIP) framework SCIP …
optimization, centered around the constraint integer programming (CIP) framework SCIP …
A supernodal formulation of vertex colouring with applications in course timetabling
For many problems in scheduling and timetabling, the choice of a mathematical
programming formulation is determined by the formulation of the graph colouring …
programming formulation is determined by the formulation of the graph colouring …
Orbital branching
We introduce orbital branching, an effective branching method for integer programs
containing a great deal of symmetry. The method is based on computing groups of variables …
containing a great deal of symmetry. The method is based on computing groups of variables …
Extended formulations in combinatorial optimization
This survey is concerned with the size of perfect formulations for combinatorial optimization
problems. By “perfect formulation”, we mean a system of linear inequalities that describes …
problems. By “perfect formulation”, we mean a system of linear inequalities that describes …
Optimizing over trained GNNs via symmetry breaking
Optimization over trained machine learning models has applications including: verification,
minimizing neural acquisition functions, and integrating a trained surrogate into a larger …
minimizing neural acquisition functions, and integrating a trained surrogate into a larger …