A set‐partitioning‐based exact algorithm for the vehicle routing problem
From MaRDI portal
Publication:4732297
DOI10.1002/net.3230190702zbMath0682.90050OpenAlexW1993756010MaRDI QIDQ4732297
Harvey M. Salkin, Y. K. Agarwal, Kamlesh Mathur
Publication date: 1989
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230190702
Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Boolean programming (90C09)
Related Items
Column Generation based Primal Heuristics, Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem, A TSSP+1 decomposition strategy for the vehicle routing problem, Linear temporal logic vehicle routing with applications to multi-UAV mission planning, Stronger multi-commodity flow formulations of the capacitated vehicle routing problem, Analytic centre stabilization of column generation algorithm for the capacitated vehicle routing problem, Vehicle routing concepts in the closed-loop container network of ARN -- a case study, Routing problems: A bibliography, Search-hide games on trees, Matheuristics: survey and synthesis, Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs, Solving a fuel delivery problem by heuristic and exact approaches., A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching, Primal Heuristics for Branch and Price: The Assets of Diving Methods, Detecting critical node structures on graphs: A mathematical programming approach, A matheuristic for the cell formation problem, A dual ascent procedure for the set partitioning problem, The vehicle routing problem: An overview of exact and approximate algorithms, Combinatorial optimization and green logistics, Integer programming models for the multidimensional assignment problem with star costs, Models, relaxations and exact approaches for the capacitated vehicle routing problem, A LP-based heuristic for a time-constrained routing problem, Combinatorial optimization and green logistics, Robust branch-and-cut-and-price for the capacitated vehicle routing problem, Capacity and assortment planning under one-way supplier-driven substitution for pharmacy kiosks with low drug demand, A new subtour elimination constraint for the vehicle routing problem
