The SCIP optimization suite 8.0

K Bestuzheva, M Besançon, WK Chen… - arxiv preprint arxiv …, 2021 - arxiv.org
The SCIP Optimization Suite provides a collection of software packages for mathematical
optimization centered around the constraint integer programming framework SCIP. This …

Combinatorial optimization and reasoning with graph neural networks

Q Cappart, D Chételat, EB Khalil, A Lodi… - Journal of Machine …, 2023 - jmlr.org
Combinatorial optimization is a well-established area in operations research and computer
science. Until recently, its methods have focused on solving problem instances in isolation …

Enabling research through the SCIP optimization suite 8.0

K Bestuzheva, M Besançon, WK Chen… - ACM Transactions on …, 2023 - dl.acm.org
The scip Optimization Suite provides a collection of software packages for mathematical
optimization centered around the constraint integer programming framework scip. The focus …

The SCIP optimization suite 9.0

S Bolusani, M Besançon, K Bestuzheva… - arxiv preprint arxiv …, 2024 - arxiv.org
The SCIP Optimization Suite provides a collection of software packages for mathematical
optimization, centered around the constraint integer programming (CIP) framework SCIP …

Branch-and-cut-and-price for the electric vehicle routing problem with time windows, piecewise-linear recharging and capacitated recharging stations

E Lam, G Desaulniers, PJ Stuckey - Computers & Operations Research, 2022 - Elsevier
Abstract The Electric Vehicle Routing Problem with Time Windows, Piecewise-Linear
Recharging and Capacitated Recharging Stations aims to design minimum-cost routes for a …

Learning to branch with tree mdps

L Scavuzzo, F Chen, D Chételat… - Advances in neural …, 2022 - proceedings.neurips.cc
State-of-the-art Mixed Integer Linear Programming (MILP) solvers combine systematic tree
search with a plethora of hard-coded heuristics, such as branching rules. While approaches …

Practical large-scale linear programming using primal-dual hybrid gradient

D Applegate, M Díaz, O Hinder, H Lu… - Advances in …, 2021 - proceedings.neurips.cc
We present PDLP, a practical first-order method for linear programming (LP) that can solve
to the high levels of accuracy that are expected in traditional LP applications. In addition, it …

Branch-and-cut-and-price for multi-agent path finding

E Lam, P Le Bodic, D Harabor, PJ Stuckey - Computers & Operations …, 2022 - Elsevier
Abstract The Multi-Agent Path Finding problem aims to find a set of collision-free paths that
minimizes the total cost of all paths. The problem is extensively studied in artificial …

Mip-gnn: A data-driven framework for guiding combinatorial solvers

EB Khalil, C Morris, A Lodi - Proceedings of the AAAI Conference on …, 2022 - ojs.aaai.org
Mixed-integer programming (MIP) technology offers a generic way of formulating and
solving combinatorial optimization problems. While generally reliable, state-of-the-art MIP …

[HTML][HTML] (Global) optimization: historical notes and recent developments

M Locatelli, F Schoen - EURO Journal on Computational Optimization, 2021 - Elsevier
Abstract Recent developments in (Global) Optimization are surveyed in this paper. We
collected and commented quite a large number of recent references which, in our opinion …