A branch-and-cut algorithm for vehicle routing problems

J. R. Araque G; Gautham K. Kudva; Thomas L. Morin; Joseph F. Pekny

doi:10.1007/bf02085634

ScienceGate Book Chapters

JOURNAL ARTICLE

A branch-and-cut algorithm for vehicle routing problems

J. R. Araque G Gautham K. Kudva Thomas L. Morin Joseph F. Pekny

Year: 1994 Journal: Annals of Operations Research Vol: 50 (1)Pages: 37-59 Publisher: Springer Science+Business Media

DOI: 10.1007/bf02085634

Get Full-Text PDF Get Analytical Report

Keywords:

Theory of computation Vehicle routing problem Exploit Routing (electronic design automation) Computer science Mathematical optimization Path (computing) Algorithm Branch and cut Facet (psychology) Mathematics Integer programming

Metrics

Cited By

5.48

FWCI (Field Weighted Citation Impact)

Refs

0.95

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Vehicle Routing Optimization Methods

Physical Sciences → Engineering → Industrial and Manufacturing Engineering

Optimization and Packing Problems

Physical Sciences → Engineering → Industrial and Manufacturing Engineering

Transportation and Mobility Innovations

Physical Sciences → Engineering → Automotive Engineering

A branch-and-cut algorithm for vehicle routing problems

Metrics

Citation History

Topics

Related Documents

Enhanced Branch-Cut-and-Price algorithm for heterogeneous fleet vehicle routing problems

Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm

Vehicle routing problems with different service constraints: A branch‐and‐cut‐and‐price algorithm

Balanced vehicle routing: Polyhedral analysis and branch-and-cut algorithm

Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems