A set‐partitioning‐based exact algorithm for the vehicle routing problem
From MaRDI portal
DOI10.1002/NET.3230190702zbMATH Open0682.90050OpenAlexW1993756010MaRDI QIDQ4732297FDOQ4732297
Authors: Y. K. Agarwal, Kamlesh Mathur, Harvey M. Salkin 
Publication date: 1989
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230190702
Recommendations
Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Boolean programming (90C09)
Cited In (31)
- Detecting critical node structures on graphs: a mathematical programming approach
- Chain partitioning as a key element for building vehicle routing problem heuristics
- Analytic centre stabilization of column generation algorithm for the capacitated vehicle routing problem
- Models, relaxations and exact approaches for the capacitated vehicle routing problem
- A matheuristic for the cell formation problem
- The vehicle routing problem: An overview of exact and approximate algorithms
- Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs
- Search-hide games on trees
- The spacefilling curve with optimal partitioning heuristic for the vehicle routing problem
- Matheuristics: survey and synthesis
- Combinatorial optimization and green logistics
- Capacity and assortment planning under one-way supplier-driven substitution for pharmacy kiosks with low drug demand
- Stronger multi-commodity flow formulations of the capacitated vehicle routing problem
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
- A new subtour elimination constraint for the vehicle routing problem
- Primal Heuristics for Branch and Price: The Assets of Diving Methods
- Technical Note—The Complexity of the Pricing Problem of the Set Partitioning Formulation of Vehicle Routing Problems
- Combinatorial optimization and green logistics
- Integer programming models for the multidimensional assignment problem with star costs
- Routing problems: A bibliography
- Solving a fuel delivery problem by heuristic and exact approaches.
- A dual ascent procedure for the set partitioning problem
- Vehicle routing concepts in the closed-loop container network of ARN -- a case study
- A TSSP+1 decomposition strategy for the vehicle routing problem
- A LP-based heuristic for a time-constrained routing problem
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- Linear temporal logic vehicle routing with applications to multi-UAV mission planning
- Column generation based primal heuristics
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- Delay-resistant robust vehicle routing with heterogeneous time windows
- A branch-and-price algorithm for parallel machine scheduling using ZDDs and generic branching
This page was built for publication: A set‐partitioning‐based exact algorithm for the vehicle routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4732297)
