Publication:3751354
From MaRDI portal
zbMath0611.90055MaRDI QIDQ3751354
Publication date: 1987
vehicle routing; direct search; set partitioning; vehicle flow; commodity flow; survey of exact algorithms
90C35: Programming involving graphs or networks
68Q25: Analysis of algorithms and problem complexity
90C90: Applications of mathematical programming
90C10: Integer programming
90C05: Linear programming
90B35: Deterministic scheduling theory in operations research
90B10: Deterministic network models in operations research
90C27: Combinatorial optimization
90-02: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming
Related Items
Combinatorial optimization and green logistics, Modeling vehicle routing with uncertain demands as a stochastic program: Properties of the corresponding solution, Polyhedral study of the capacitated vehicle routing problem, Models, relaxations and exact approaches for the capacitated vehicle routing problem, Dispatching a fishing trawler fleet in the Canadian Atlantic groundfish industry, Recent advances in vehicle routing exact algorithms, Solving the truck and trailer routing problem based on a simulated annealing heuristic, Models and exact solutions for a class of stochastic location-routing problems, A result on projection for the vehicle routing problem, Polyhedral results for a vehicle routing problem, The pickup and delivery problem with time windows, The vehicle routing problem: An overview of exact and approximate algorithms, Practical aspects of route planning for magazine and newspaper wholesalers, A genetic algorithm for service level based vehicle scheduling, A new subtour elimination constraint for the vehicle routing problem, Planning models for freight transportation, Vehicle routing with split deliveries, A branch-and-cut algorithm for vehicle routing problems, A real delivery problem dealt with Monte Carlo techniques, Stronger \(K\)-tree relaxations for the vehicle routing problem, A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations, A new heuristic for the fleet size and mix vehicle routing problem, Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints, Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem, Incorporating vehicle into the vehicle routing fleet composition problem, Distance-constrained capacitated vehicle routing problems with flexible assignment of start and end depots, Heuristics for the lexicographic Max-ordering vehicle routing problem, Projection results for vehicle routing
