31 citations · 44 across the 7 of their papers we have counts for
8 papers
Planning in Branch-and-Bound: Model-Based Reinforcement Learning for Exact Combinatorial Optimization
Paul Strang, Zacharie Alès, Côme Bissuel +3
Mixed-Integer Linear Programming (MILP) lies at the core of many real-world combinatorial optimization (CO) problems, traditionally solved by branch-and-bound (B&B). A key driver i…
A Markov Decision Process for Variable Selection in Branch & Bound
Paul Strang, Zacharie Alès, Côme Bissuel +3
Mixed-Integer Linear Programming (MILP) is a powerful framework used to address a wide range of NP-hard combinatorial optimization problems, often solved by Branch and Bound (B&B).…
Influence branching for learning to solve mixed-integer programs online
Paul Strang, Zacharie Alès, Côme Bissuel +3
On the occasion of the 20th Mixed Integer Program Workshop's computational competition, this work introduces a new approach for learning to solve MIPs online. Influence branching,…
Finite adaptability in two-stage robust optimization: asymptotic optimality and tractability
Safia Kedad-Sidhoum, Anton Medvedev, Frédéric Meunier
Two-stage robust optimization is a fundamental paradigm for modeling and solving optimization problems with uncertain parameters. A now classical method within this paradigm is fin…
Dominance inequalities for scheduling around an unrestrictive common due date
Anne-Elisabeth Falq, Pierre Fouilhoux, Safia Kedad-Sidhoum
The problem considered in this work consists in scheduling a set of tasks on a single machine, around an unrestrictive common due date to minimize the weighted sum of earliness and…
Reinforcement Learning for Variable Selection in a Branch and Bound Algorithm
Marc Etheve, Zacharie Alès, Côme Bissuel +2
Mixed integer linear programs are commonly solved by Branch and Bound algorithms. A key factor of the efficiency of the most successful commercial solvers is their fine-tuned heuri…
Mixed integer formulations using natural variables for single machine scheduling around a common due date
Anne-Elisabeth Falq, Pierre Fouilhoux, Safia Kedad-Sidhoum
While almost all existing works which optimally solve just-in-time scheduling problems propose dedicated algorithmic approaches, we propose in this work mixed integer formulations.…
Two-level lot-sizing with inventory bounds
Siao-Leu Phouratsamay, Safia Kedad-Sidhoum, Fanny Pascual
We study a two-level uncapacitated lot-sizing problem with inventory bounds that occurs in a supply chain composed of a supplier and a retailer. The first level with the demands is…