A branch and bound algorithm for the capacitated vehicle routing problem
From MaRDI portal
Publication:585095
DOI10.1007/BF01720015zbMATH Open0523.90088OpenAlexW2066878540MaRDI QIDQ585095FDOQ585095
Authors: G. Laporte, Yves Nobert 
Publication date: 1983
Published in: OR Spektrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01720015
Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Cites Work
- Partitioning procedures for solving mixed-variables programming problems
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- Computational comparison of two methods for finding the shortest complete cycle or circuit in a graph
- An exact algorithm for minimizing routing and operating costs in depot location
- Title not available (Why is that?)
- The traveling-salesman problem and minimum spanning trees: Part II
- Title not available (Why is that?)
- Applications of linear programming in the oil industry
- An Integer Programming Approach to the Vehicle Scheduling Problem
- State-space relaxation procedures for the computation of bounds to routing problems
- Implementing vehicle routing algorithms
- Two exact algorithms for the distance-constrained vehicle routing problem
- A restricted Lagrangean approach to the traveling salesman problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the symmetric travelling salesman problem: Solution of a 120-city problem
- Integer programming approaches to the travelling salesman 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
- New enhancements for the exact solution of the vehicle routing problem with time windows
- A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints
- 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
- Exact separation of the rounded capacity inequalities for the capacitated vehicle routing problem
- A compact model and tight bounds for a combined location-routing problem
- Stronger multi-commodity flow formulations of the capacitated vehicle routing problem
- The two-echelon stochastic multi-period capacitated location-routing problem
- Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems
- Planning robust drone-truck delivery routes under road traffic uncertainty
- An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem
- 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
- 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
- Polyhedral results for a vehicle routing problem
- 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
- 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
- Projection results for vehicle routing
- A compact transformation of arc routing problems into node routing problems
Uses Software
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)
