A combinatorial Benders' decomposition for the lock scheduling problem
From MaRDI portal
Publication:337348
DOI10.1016/j.cor.2014.09.007zbMath1348.90318OpenAlexW1985424519MaRDI QIDQ337348
Jannes Verstichel, Joris Kinable, Greet vanden Berghe, Patrick de Causmaecker
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://lirias.kuleuven.be/handle/123456789/463251
Related Items (17)
Novel Formulations and Logic-Based Benders Decomposition for the Integrated Parallel Machine Scheduling and Location Problem ⋮ The multi-period multi-trip container drayage problem with release and due dates ⋮ Single batch machine scheduling with dual setup times for autoclave molding manufacturing ⋮ The design of a reliable and robust hierarchical health service network using an accelerated Benders decomposition algorithm ⋮ Coordinated optimized scheduling of locks and transshipment in inland waterway transportation using binary NSGA‐II ⋮ Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition ⋮ Logic-Based Benders Decomposition for Large-Scale Optimization ⋮ Scheduling two-way ship traffic for the Kiel Canal: model, extensions and a matheuristic ⋮ Exact and heuristic methods for optimizing lock-quay system in inland waterway ⋮ Combinatorial Benders cuts for assembly line balancing problems with setups ⋮ The Benders decomposition algorithm: a literature review ⋮ A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates ⋮ An exact approach to the generalized serial-lock scheduling problem from a flexible job-shop scheduling perspective ⋮ Optimally solving the generalized serial-lock scheduling problem from a graph-theory-based multi-commodity network perspective ⋮ The multiple multidimensional knapsack with family-split penalties ⋮ A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions ⋮ Logic-based Benders decomposition algorithm for contamination detection problem in water networks
Cites Work
- A Benders approach for the constrained minimum break problem
- Partitioning procedures for solving mixed-variables programming problems
- Logic-based Benders decomposition
- Exact and heuristic methods for placing ships in locks
- Generalized Benders decomposition
- Combinatorial Benders Cuts for the Minimum Tollbooth Problem
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Unnamed Item
This page was built for publication: A combinatorial Benders' decomposition for the lock scheduling problem
