Lookback for learning to branch
The expressive and computationally inexpensive bipartite Graph Neural Networks (GNN)
have been shown to be an important component of deep learning based Mixed-Integer …
have been shown to be an important component of deep learning based Mixed-Integer …
Mixed integer linear programming formulation techniques
JP Vielma - Siam Review, 2015 - SIAM
A wide range of problems can be modeled as Mixed Integer Linear Programming (MIP)
problems using standard formulation techniques. However, in some cases the resulting MIP …
problems using standard formulation techniques. However, in some cases the resulting MIP …
A deep instance generative framework for milp solvers under limited data availability
In the past few years, there has been an explosive surge in the use of machine learning (ML)
techniques to address combinatorial optimization (CO) problems, especially mixed-integer …
techniques to address combinatorial optimization (CO) problems, especially mixed-integer …
MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
A Gleixner, G Hendel, G Gamrath, T Achterberg… - Mathematical …, 2021 - Springer
We report on the selection process leading to the sixth version of the Mixed Integer
Programming Library, MIPLIB 2017. Selected from an initial pool of 5721 instances, the new …
Programming Library, MIPLIB 2017. Selected from an initial pool of 5721 instances, the new …
Pivot, cut, and dive: a heuristic for 0-1 mixed integer programming
J Eckstein, M Nediak - Journal of Heuristics, 2007 - Springer
This paper describes a heuristic for 0-1 mixed-integer linear programming problems,
focusing on “stand-alone” implementation. Our approach is built around concave “merit …
focusing on “stand-alone” implementation. Our approach is built around concave “merit …
Scatter search to generate diverse MIP solutions
F Glover, A Løkketangen, DL Woodruff - Computing Tools for Modeling …, 2000 - Springer
An objective function often is only a rough approximation of the actual goals of the
organization and its stakeholders. Consequently, an optimal solution may be no more …
organization and its stakeholders. Consequently, an optimal solution may be no more …
Implementing automatic Benders decomposition in a modern MIP solver
P Bonami, D Salvagnin, A Tramontani - … , IPCO 2020, London, UK, June 8 …, 2020 - Springer
We describe the automatic Benders decomposition implemented in the commercial solver
IBM CPLEX. We propose several improvements to the state-of-the-art along two lines …
IBM CPLEX. We propose several improvements to the state-of-the-art along two lines …
Progress in presolving for mixed integer programming
This paper describes three presolving techniques for solving mixed integer programming
problems (MIPs) that were implemented in the academic MIP solver SCIP. The task of …
problems (MIPs) that were implemented in the academic MIP solver SCIP. The task of …
Reinforcement learning for branch-and-bound optimisation using retrospective trajectories
Combinatorial optimisation problems framed as mixed integer linear programmes (MILPs)
are ubiquitous across a range of real-world applications. The canonical branch-and-bound …
are ubiquitous across a range of real-world applications. The canonical branch-and-bound …
Ten years of feasibility pump, and counting
Abstract The Feasibility Pump (fp) is probably the best-known primal heuristic for mixed-
integer programming. The original work by Fischetti et al.(Math Program 104 (1): 91–104 …
integer programming. The original work by Fischetti et al.(Math Program 104 (1): 91–104 …