A set‐partitioning‐based exact algorithm for the vehicle routing problem

Publisher Website

1 December 1989

journal article
research article
Published by Wiley in Networks

Vol. 19 (7), 731-749
https://doi.org/10.1002/net.3230190702

Abstract

No abstract available

Keywords

This publication has 10 references indexed in Scilit:

Optimal Routing under Capacity and Distance Restrictions
Operations Research, 1985
Routing with time windows by column generation
Networks, 1984
Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
Mathematical Programming, 1981
Set partitioning based heuristics for interactive routing
Networks, 1981
A generalized assignment heuristic for vehicle routing
Networks, 1981
An Integer Programming Approach to the Vehicle Scheduling Problem
Journal of the Operational Research Society, 1976
A Heuristic Algorithm for the Vehicle-Dispatch Problem
Operations Research, 1974
Improved Combinatorial Programming Algorithms for a Class of All-Zero-One Integer Programming Problems
Management Science, 1973
Scheduling of Vehicles from a Central Depot to a Number of Delivery Points
Operations Research, 1964
On an Integer Program for a Delivery Problem
Operations Research, 1964

Cited by 79 articles