Polyhedral study of the capacitated vehicle routing problem
From MaRDI portal
Publication:688914
DOI10.1007/BF01580599zbMATH Open0790.90029OpenAlexW1998205685MaRDI QIDQ688914FDOQ688914
Authors: Farid Harche, Gérard Cornuéjols 
Publication date: 1 November 1993
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01580599
Recommendations
polyhedronfacetbranch and cutcapacitated vehicle routingcutting plane algorithmsubtour eliminationcomb inequalitiescentral depottotal distance traveled
Programming involving graphs or networks (90C35) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Transportation, logistics and supply chain management (90B06)
Cites Work
- Title not available (Why is that?)
- The traveling salesman problem on a graph and some related integer polyhedra
- Title not available (Why is that?)
- Optimization of a 532-city symmetric traveling salesman problem by branch and cut
- Clique Tree Inequalities and the Symmetric Travelling Salesman Problem
- On the symmetric travelling salesman problem I: Inequalities
- Title not available (Why is that?)
- Title not available (Why is that?)
- An Integer Programming Approach to the Vehicle Scheduling Problem
- Optimal Routing under Capacity and Distance Restrictions
- Polyhedral results for a vehicle routing problem
- Edmonds polytopes and weakly hamiltonian graphs
- On the symmetric travelling salesman problem: A computational study
- On the symmetric travelling salesman problem: Solution of a 120-city problem
- A new class of cutting planes for the symmetric travelling salesman problem
- The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities
- The traveling salesman problem in graphs with some excluded minors
- Title not available (Why is that?)
- The Symmetric Traveling Salesman Polytope: New Facets from the Graphical Relaxation
Cited In (36)
- New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP
- Some thoughts on combinatorial optimisation
- Bilevel programming and the separation problem
- Models, relaxations and exact approaches for the capacitated vehicle routing problem
- The pyramidal capacitated vehicle routing problem
- Balanced vehicle routing: polyhedral analysis and branch-and-cut algorithm
- Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems
- Planning models for freight transportation
- On the complexity of the separation problem for rounded capacity inequalities
- Facets of the polytope of the asymmetric travelling salesman problem with replenishment arcs
- Exact algorithms for routing problems under vehicle capacity constraints
- A polyhedral study of the cardinality constrained multi-cycle and multi-chain problem on directed graphs
- A sweep-based algorithm for the fleet size and mix vehicle routing problem
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
- A heuristic algorithm for the asymmetric capacitated vehicle routing problem
- A branch-and-cut algorithm for the multi-compartment vehicle routing problem with flexible compartment sizes
- On the capacitated vehicle routing problem
- Recent advances in vehicle routing exact algorithms
- A result on projection for the vehicle routing problem
- Routing problems: A bibliography
- A branch-and-cut algorithm for an assembly routing problem
- Separating capacity constraints in the CVRP using tabu search
- Branch and cut methods for network optimization
- A generalized exchange heuristic for the capacitated vehicle routing problem
- Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems
- Stronger \(K\)-tree relaxations for the vehicle routing problem
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem
- On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches
- On the vehicle routing problem with lower bound capacities
- Survey of facial results for the traveling salesman polytope
- A multi-stop routing problem
- Title not available (Why is that?)
- Modeling and solving the capacitated vehicle routing problem on trees
- Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route
Uses Software
This page was built for publication: Polyhedral study of the capacitated vehicle routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q688914)
