An interior-point Benders based branch-and-cut algorithm for mixed integer programs

By Joe Naoum-Sawaya, Samir Elhedhli. 2010

80 citations recorded by the source corpus.

Subfields: Control and Systems Engineering, Industrial and Manufacturing Engineering

How researchers see this paper

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

In Control and Systems Engineering

1. Teodor Gabriel Crainic
2. Michel Gendreau
3. Walter Rei
4. Ragheb Rahmaniani
5. Berk Ustun
6. Cynthia Rudin

In Industrial and Manufacturing Engineering

1. Teodor Gabriel Crainic
2. Michel Gendreau
3. Walter Rei
4. Ragheb Rahmaniani
5. Berk Ustun
6. Cynthia Rudin
7. Thibaut Vidal
8. Christian Prins

Citations in the corpus

• Learning Optimized Risk Scores (2016, methodology): “008). Our proposed lattice CP algorithm makes use of callback functions in modern MIP solvers, which can dynamically add cutting planes within a branchand-bound search (see e.g., Bai and Rubin, 2009; Naoum-Sawaya and Elhedhli, 2010, for a similar uses of callback functions in the optimization litera”
• Methods and Models for Interpretable Linear Classification (2014, methodology): “In practice, we can improve the baseline performance of loss decomposition on datasets with large P by using a one-tree implementation [8, 82].”
• The Benders decomposition algorithm: A literature review (2017, methodology): “A straightforward application of the classical BD algorithm may require excessive computing time and memory (Magnanti and Wong, 1981; Naoum-Sawaya and Elhedhli, 2013).”