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

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

doi:10.1007/978-3-540-25960-2_1

ScienceGate Book Chapters

BOOK-CHAPTER

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

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

Year: 2004 Lecture notes in computer science Pages: 1-15 Publisher: Springer Science+Business Media

DOI: 10.1007/978-3-540-25960-2_1

Get Full-Text PDF Get Analytical Report

Keywords:

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

Metrics

Cited By

21.20

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