A branch and bound algorithm for the capacitated vehicle routing problem
From MaRDI portal
(Redirected from Publication:585095)
Cites work
- scientific article; zbMATH DE number 3643061 (Why is no real title available?)
- scientific article; zbMATH DE number 3526435 (Why is no real title available?)
- scientific article; zbMATH DE number 3438384 (Why is no real title available?)
- scientific article; zbMATH DE number 3373541 (Why is no real title available?)
- A restricted Lagrangean approach to the traveling salesman problem
- An Integer Programming Approach to the Vehicle Scheduling Problem
- An exact algorithm for minimizing routing and operating costs in depot location
- Applications of linear programming in the oil industry
- Computational comparison of two methods for finding the shortest complete cycle or circuit in a graph
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- Implementing vehicle routing algorithms
- Integer programming approaches to the travelling salesman problem
- On the symmetric travelling salesman problem: Solution of a 120-city problem
- Partitioning procedures for solving mixed-variables programming problems
- State-space relaxation procedures for the computation of bounds to routing problems
- The traveling-salesman problem and minimum spanning trees: Part II
- Two exact algorithms for the distance-constrained vehicle routing problem
Cited in
(40)- An overview of graph covering and partitioning
- Robust vehicle routing under uncertainty via branch-price-and-cut
- A POPMUSIC matheuristic for the capacitated vehicle routing problem
- Capacitated vehicle routing problem on line with unsplittable demands
- A cutting plane procedure for the travelling salesman problem on road networks
- A generic exact solver for vehicle routing and related problems
- An improved formulation for the inventory routing problem with time-varying demands
- A branch-and-cut embedded matheuristic for the inventory routing problem
- A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints
- New enhancements for the exact solution of the vehicle routing problem with time windows
- The vehicle routing problem with demand range
- A mixed constrained (identical) vehicle routing problem for time minimisation
- Vehicle routing with endogenous learning: application to offshore plug and abandonment campaign planning
- A compact model and tight bounds for a combined location-routing problem
- Exact separation of the rounded capacity inequalities for the capacitated vehicle routing problem
- Stronger multi-commodity flow formulations of the capacitated vehicle routing problem
- Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems
- The two-echelon stochastic multi-period capacitated location-routing problem
- An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem
- Planning robust drone-truck delivery routes under road traffic uncertainty
- A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem
- Routing and scheduling field service operation by P-graph
- Estimating the marginal cost to deliver to individual customers
- Vehicle routing with split deliveries
- Routing problems: A bibliography
- The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time
- Strong cuts from compatibility relations for the dial-a-ride problem
- A new mixed integer linear model for a rich vehicle routing problem with docking constraints
- Stronger K-tree relaxations for the vehicle routing problem
- Polyhedral results for a vehicle routing problem
- A unified exact approach for clustered and generalized vehicle routing problems
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- Distance-constrained capacitated vehicle routing problems with flexible assignment of start and end depots
- A scatter search for multi-depot vehicle routing problem with weight-related cost
- Encoding binary arithmetic operations in integer programming formulations
- Solving an urban waste collection problem using ants heuristics
- Projection results for vehicle routing
- A unified exact approach for a broad class of vehicle routing problems with simultaneous pickup and delivery
- Routing and scheduling of platform supply vessels in offshore oil and gas logistics
- A compact transformation of arc routing problems into node routing problems
This page was built for publication: A branch and bound algorithm for the capacitated vehicle routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q585095)
