2-Path Cuts for the Vehicle Routing Problem with Time Windows

Kohl, Niklas; Solomon, Marius M.; Madsen, Oli B. G.; Desrosiers, Jacques; Soumis, François

doi:10.1287/trsc.33.1.101

Record: found
Abstract: not found
Article: not found

2-Path Cuts for the Vehicle Routing Problem with Time Windows

Author(s): Niklas Kohl , Jacques Desrosiers , Oli B. G. Madsen , Marius M. Solomon , François Soumis

Publication date Created: February 1999

Publication date (Print): February 1999

Journal: Transportation Science

Publisher: Institute for Operations Research and the Management Sciences (INFORMS)

Read this article at

ScienceOpenPublisher

Bookmark

There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

Related collections

Most cited references 15

Record: found
Abstract: not found
Article: not found

A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows

Marius M. Solomon, Jacques Desrosiers, Martin Desrochers (1992)

0 comments Cited 135 times – based on 0 reviews      Review now

Bookmark

Record: found
Abstract: not found
Book Chapter: not found

Lagrangean relaxation for integer programming

A. Geoffrion (1974)

0 comments Cited 127 times – based on 0 reviews

Bookmark

Record: found
Abstract: not found
Article: not found

Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees

Marshall Fisher (1994)

0 comments Cited 65 times – based on 0 reviews      Review now

Bookmark

All references

Author and article information

Journal

Title: Transportation Science

Abbreviated Title: Transportation Science

Publisher: Institute for Operations Research and the Management Sciences (INFORMS)

ISSN (Print): 0041-1655

ISSN (Electronic): 1526-5447

Publication date Created: February 1999

Publication date (Print): February 1999

Volume: 33

Issue: 1

Pages: 101-116

Article

DOI: 10.1287/trsc.33.1.101

SO-VID: 19a0c9b5-d0bf-454e-bebf-2791edc65796

History

Data availability:

2-Path Cuts for the Vehicle Routing Problem with Time Windows

Read this article at

Related collections

Path of Science

Most cited references 15

A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows

Lagrangean relaxation for integer programming

Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees

Author and article information

Journal

Article

History

Comments

Comment on this article

Similar content 2,035

Cited by 50

Most referenced authors 88