Simultaneously exploiting two formulations: an exact Benders decomposition approach
From MaRDI portal
Publication:2664373
DOI10.1016/j.cor.2020.105041zbMath1458.90485OpenAlexW2601482926MaRDI QIDQ2664373
Mette Gamst, Simon Spoorendonk, Stefan Ropke, Richard M. Lusby
Publication date: 20 April 2021
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://orbit.dtu.dk/ws/files/158901772/rl_euro_2018.pdf
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Branch-and-cut algorithms for the split delivery vehicle routing problem
- An iterated local search heuristic for the split delivery vehicle routing problem
- Branching in branch-and-price: A generic scheme
- On compact formulations for integer programs solved by column generation
- A general heuristic for vehicle routing problems
- A Branch and Price algorithm for the \(k\)-splittable maximum flow problem
- A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
- Improved lower bounds for the split delivery vehicle routing problem
- An improved Benders decomposition applied to a multi-layer network design problem
- Partitioning procedures for solving mixed-variables programming problems
- New optimization heuristics. The great deluge algorithm and the record- to-record travel
- Exact solution of bin-packing problems using column generation and branch-and-bound
- Vehicle routing with split deliveries
- Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
- On the capacitated vehicle routing problem
- New exact solution approaches for the split delivery vehicle routing problem
- A parallel route building algorithm for the vehicle routing and scheduling problem with time windows
- An interior-point Benders based branch-and-cut algorithm for mixed integer programs
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- Iterative variable aggregation and disaggregation in IP: an application
- Mathematical Methods of Organizing and Planning Production
- Split delivery routing
- Decomposition Principle for Linear Programs
- Dual-Optimal Inequalities for Stabilized Column Generation
- A Lower Bound for the Split Delivery Vehicle Routing Problem
- Selected Topics in Column Generation
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- Cutting Stock Problems
- The traveling-salesman problem and minimum spanning trees: Part II
This page was built for publication: Simultaneously exploiting two formulations: an exact Benders decomposition approach
