A new branch-and-cut algorithm for the capacitated vehicle routing problem

Jens Lysgaard; Adam N. Letchford; Richard Eglese

doi:10.1007/s10107-003-0481-8

ScienceGate Book Chapters

JOURNAL ARTICLE

A new branch-and-cut algorithm for the capacitated vehicle routing problem

Jens Lysgaard Adam N. Letchford Richard Eglese

Year: 2004 Journal: Mathematical Programming Vol: 100 (2)Pages: 423-445 Publisher: Springer Science+Business Media

DOI: 10.1007/s10107-003-0481-8

Get Full-Text PDF Get Analytical Report

Keywords:

Branch and cut Mathematics Vehicle routing problem Algorithm Mathematical optimization Branching (polymer chemistry) Selection (genetic algorithm) Node (physics) Integer programming Routing (electronic design automation) Integer (computer science) Computer science Artificial intelligence

Metrics

593

Cited By

38.69

FWCI (Field Weighted Citation Impact)

Refs

1.00

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 new branch-and-cut algorithm for the capacitated vehicle routing problem

Metrics

Citation History

Topics

Related Documents

A branch-and-cut algorithm for the capacitated open vehicle routing problem

An Improved Branch-and-Cut Algorithm for the Capacitated Vehicle Routing Problem

A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem

A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem

A Branch-and-Cut Algorithm for the Symmetric Two-Echelon Capacitated Vehicle Routing Problem