Combinatorial Benders' Cuts for Mixed-Integer Linear Programming

By Gianni Codato, Matteo Fischetti. Operational Research, 2006

468 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Industrial and Manufacturing Engineering, Numerical Analysis

View Paper: https://www.semanticscholar.org/paper/7ba61b0c68ee3b4557d888146f0f109593d96470

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Teodor Gabriel Crainic
2. Michel Gendreau
3. Walter Rei
4. Ragheb Rahmaniani
5. Michael Drexl
6. Greger Ottosson
7. John N. Hooker

In Industrial and Manufacturing Engineering

1. Teodor Gabriel Crainic
2. Michael Drexl
3. Michel Gendreau
4. Walter Rei
5. Ragheb Rahmaniani
6. Thibaut Vidal
7. Christian Prins
8. Michael Schneider

In Numerical Analysis

1. Teodor Gabriel Crainic
2. Michel Gendreau
3. Walter Rei
4. Ragheb Rahmaniani
5. Michael Drexl

Citations in the corpus

• Logic-based Benders decomposition (2003, unknown): “Combinatorial Benders cuts [9] are strengthened nogood feasibility cuts used in the context of a specialized branch-and-check procedure designed for mixed integer/linear programming (MILP).”
• Synchronization in Vehicle Routing - A Survey of VRPs with Multiple Synchronization Constraints (2012, methodology): “develop a branch-and-cut algorithm based on Benders decomposition ([13]) and the combinatorial Benders cuts introduced by Codato/Fischetti [35].”
• The Benders decomposition algorithm: A literature review (2017, background): “Cordeau et al. (2006) studied a stochastic logistic network design problem.”