A branch and bound algorithm for the capacitated vehicle routing problem
From MaRDI portal
Publication:585095
DOI10.1007/BF01720015zbMath0523.90088OpenAlexW2066878540MaRDI QIDQ585095
Publication date: 1983
Published in: OR Spektrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01720015
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items
Vehicle routing with split deliveries, A compact model and tight bounds for a combined location-routing problem, An overview of graph covering and partitioning, Stronger multi-commodity flow formulations of the capacitated vehicle routing problem, Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems, Routing problems: A bibliography, The vehicle routing problem with demand range, Routing and scheduling field service operation by P-graph, A POPMUSIC matheuristic for the capacitated vehicle routing problem, An improved formulation for the inventory routing problem with time-varying demands, A branch-and-cut embedded matheuristic for the inventory routing problem, Estimating the marginal cost to deliver to individual customers, The two-echelon stochastic multi-period capacitated location-routing problem, Planning robust drone-truck delivery routes under road traffic uncertainty, A generic exact solver for vehicle routing and related problems, New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows, Distance-constrained capacitated vehicle routing problems with flexible assignment of start and end depots, A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem, Exact separation of the rounded capacity inequalities for the capacitated vehicle routing problem, A new mixed integer linear model for a rich vehicle routing problem with docking constraints, Polyhedral results for a vehicle routing problem, A SCATTER SEARCH FOR MULTI-DEPOT VEHICLE ROUTING PROBLEM WITH WEIGHT-RELATED COST, The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time, Solving an urban waste collection problem using ants heuristics, A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints, Robust branch-and-cut-and-price for the capacitated vehicle routing problem, Encoding binary arithmetic operations in integer programming formulations, Vehicle routing with endogenous learning: application to offshore plug and abandonment campaign planning, A mixed constrained (identical) vehicle routing problem for time minimisation, Strong cuts from compatibility relations for the dial-a-ride problem, Stronger \(K\)-tree relaxations for the vehicle routing problem, Capacitated vehicle routing problem on line with unsplittable demands, An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem, A compact transformation of arc routing problems into node routing problems, Robust vehicle routing under uncertainty via branch-price-and-cut, Projection results for vehicle routing, A unified exact approach for clustered and generalized vehicle routing problems, A cutting plane procedure for the travelling salesman problem on road networks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partitioning procedures for solving mixed-variables programming problems
- An exact algorithm for minimizing routing and operating costs in depot location
- Applications of Linear Programming in the Oil Industry
- Two exact algorithms for the distance-constrained vehicle routing problem
- On the symmetric travelling salesman problem: Solution of a 120-city problem
- State-space relaxation procedures for the computation of bounds to routing problems
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- A restricted Lagrangean approach to the traveling salesman problem
- Computational comparison of two methods for finding the shortest complete cycle or circuit in a graph
- An Integer Programming Approach to the Vehicle Scheduling Problem
- Integer programming approaches to the travelling salesman problem
- Implementing vehicle routing algorithms
- The traveling-salesman problem and minimum spanning trees: Part II
