Planning and Scheduling by Logic-Based Benders Decomposition
By John N. Hooker. Operational Research, 2007
319 citations recorded by the source corpus.
Subfields: Computational Theory and Mathematics, Computer Networks and Communications, Industrial and Manufacturing Engineering
View Paper: https://www.semanticscholar.org/paper/62012add71c342fa4b6739b88010bebd412978b4
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
- Teodor Gabriel Crainic
- Paul Shaw
- Philippe Laborie
- Michel Gendreau
- Tobias Achterberg
- Walter Rei
- Ragheb Rahmaniani
- Jessica Davies
In Computer Networks and Communications
- Teodor Gabriel Crainic
- Paul Shaw
- Philippe Laborie
- Michel Gendreau
- Tobias Achterberg
- Walter Rei
- Ragheb Rahmaniani
- Jessica Davies
In Industrial and Manufacturing Engineering
- Teodor Gabriel Crainic
- Michel Gendreau
- Paul Shaw
- Philippe Laborie
- Tobias Achterberg
- Walter Rei
- Ragheb Rahmaniani
- Jessica Davies
Citations in the corpus
- SCIP: solving constraint integer programs (2009, background): “Other approaches to integrate general constraint and mixed integer programming into a single framework have been proposed in the literature as well, for example [10,17,32,58].”
- The Benders decomposition algorithm: A literature review (2017, methodology): “It has been applied to a range of problems, including planning and scheduling (e.g., Hooker, 2007; Benoist et al., 2002), facility location/fleet management (Zarandi, 2010), radia- 24 CIRRELT-2016-30 tion therapy (Luong, 2015), transportation network design (Peterson and Trick, 2009), and the…”
- Solving MAXSAT by Decoupling Optimization and Satisfaction (2014, methodology): “It now becomes more like a logic based Benders decomposition approach (Hooker, 2007).”
- IBM ILOG CP optimizer for scheduling (2018, methodology): “More recently, a very simple CP Optimizer model [32] was used to close the resource allocation and scheduling benchmark introduced in [20].”