Polyhedral study of the capacitated vehicle routing problem
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3989085 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3892967 (Why is no real title available?)
- scientific article; zbMATH DE number 3895002 (Why is no real title available?)
- A new class of cutting planes for the symmetric travelling salesman problem
- An Integer Programming Approach to the Vehicle Scheduling Problem
- Clique Tree Inequalities and the Symmetric Travelling Salesman Problem
- Edmonds polytopes and weakly hamiltonian graphs
- On the symmetric travelling salesman problem I: Inequalities
- On the symmetric travelling salesman problem: A computational study
- On the symmetric travelling salesman problem: Solution of a 120-city problem
- Optimal Routing under Capacity and Distance Restrictions
- Optimization of a 532-city symmetric traveling salesman problem by branch and cut
- Polyhedral results for a vehicle routing problem
- The Symmetric Traveling Salesman Polytope: New Facets from the Graphical Relaxation
- The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities
- The traveling salesman problem in graphs with some excluded minors
- The traveling salesman problem on a graph and some related integer polyhedra
Cited in
(36)- Some thoughts on combinatorial optimisation
- New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP
- 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
- Planning models for freight transportation
- Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems
- 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
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
- A sweep-based algorithm for the fleet size and mix vehicle routing problem
- 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
- On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches
- Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem
- On the vehicle routing problem with lower bound capacities
- A multi-stop routing problem
- Survey of facial results for the traveling salesman polytope
- Modeling and solving the capacitated vehicle routing problem on trees
- scientific article; zbMATH DE number 3892967 (Why is no real title available?)
- Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route
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)
