Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem

Ricardo Fukasawa; Humberto J. Longo; Jens Lysgaard; Marcus Poggi de Aragão; Marcelo Reis; Eduardo Uchoa; Renato F. Werneck

doi:10.1007/s10107-005-0644-x

ScienceGate Book Chapters

JOURNAL ARTICLE

Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem

Ricardo Fukasawa Humberto J. Longo Jens Lysgaard Marcus Poggi de Aragão Marcelo Reis Eduardo Uchoa Renato F. Werneck

Year: 2005 Journal: Mathematical Programming Vol: 106 (3)Pages: 491-511 Publisher: Springer Science+Business Media

DOI: 10.1007/s10107-005-0644-x

Get Full-Text PDF Get Analytical Report

Keywords:

Column generation Branch and cut Vehicle routing problem Mathematics Polytope Relaxation (psychology) Intersection (aeronautics) Mathematical optimization Linear programming relaxation Branch and bound Routing (electronic design automation) Upper and lower bounds Lagrangian relaxation Maximum cut Combinatorics Linear programming Algorithm Computer science Graph

Metrics

519

Cited By

46.39

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

Transportation and Mobility Innovations

Physical Sciences → Engineering → Automotive Engineering

Smart Parking Systems Research

Physical Sciences → Engineering → Building and Construction

Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem

Metrics

Citation History

Topics

Related Documents

Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem

Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty

Improved branch-cut-and-price for capacitated vehicle routing

Improved Branch-Cut-and-Price for Capacitated Vehicle Routing

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