Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems

By Vipul Jain, Ignacio E. Grossmann. INFORMS journal on computing, 2001

428 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Control and Systems Engineering, Industrial and Manufacturing Engineering

View Paper: https://www.semanticscholar.org/paper/e5705054e08238044833e29c30b015e35270e605

How researchers see this paper

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

In Computer Networks and Communications

1. John N. Hooker
2. George L. Nemhauser
3. Matteo Fischetti
4. Teodor Gabriel Crainic
5. Michel Gendreau
6. Walter Rei
7. Ragheb Rahmaniani
8. Tobias Achterberg

In Control and Systems Engineering

1. John N. Hooker
2. Iiro Harjunkoski
3. Christos T. Maravelias
4. Charles Sung
5. Ignacio E. Grossmann
6. Teodor Gabriel Crainic
7. Michel Gendreau
8. Walter Rei

In Industrial and Manufacturing Engineering

1. Teodor Gabriel Crainic
2. Michel Gendreau
3. Ignacio E. Grossmann
4. Tobias Achterberg
5. John N. Hooker
6. Christos T. Maravelias
7. Charles Sung
8. Walter Rei

Citations in the corpus

• 50 Years of Integer Programming 1958-2008 - From the Early Years to the State-of-the-Art (2010, methodology): “The multi-machine job assignment problem was first treated by Jain and Grossman [57].”
• Combinatorial Benders' Cuts for Mixed-Integer Linear Programming (2006, background): “This approach was proposed in [19] and later named " branch and check " by Thorsteinsson [32], who successfully applied it to the Jain and Grossmann problems.”
• Planning and scheduling in the process industry (2002, result): “This results in hybrid approaches (see, for instance, [32] and [37]), i.”
• Integration of production planning and scheduling: Overview, challenges and opportunities (2009, positive): “A common strategy is to keep job assignment constraints and variables but discard sequencing constraints and variables (Jain and Grossmann, 2001; Harjunkoski and Grossmann, 2004; Maravelias, 2006; Romero et al., 2003).”
• SCIP: solving constraint integer programs (2009, background): “Several authors showed that an integrated approach can help to solve optimization problems that were intractable with either of the two methods alone (see for instance, [33,60,95]).”
• Planning and Scheduling by Logic-Based Benders Decomposition (2007, methodology): “The application of logic-based Benders to planning and scheduling was proposed by Hooker (2000) and first implemented by Jain and Grossmann (2001).”
• The Benders decomposition algorithm: A literature review (2017, methodology): “The LBBD method outperforms state-of-the-art MIP and CP solvers, often by several orders of magnitude (e.g., Jain and Grossmann, 2001).”
• Logic-based Benders decomposition (2003, neutral): “For instance, Jain and Grossmann [ 31 ] recently solved machine schedul-”
• A decomposition approach for the scheduling of a steel plant production (2001, methodology): “Combining Constraint Logic Programming (CLP) methods with Mixed Integer Linear Programming (MILP) has been proposed by Jain and Grossmann (2001) for a certain class of scheduling problems.”