A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand

Publication type:
Journal article
Metadata:
Autoren
  • Nicola Bianchessi
  • Stefan Irnich
  • Christian Tilk
Autoren-URL
https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=fis-test-1&SrcAuth=WosAPI&KeyUT=WOS:000583891700013&DestLinkType=FullRecord&DestApp=WOS_CPL
DOI
10.1016/j.dam.2020.08.014
eISSN
1872-6771
Externe Identifier
  • Clarivate Analytics Document Solution ID: OJ3UY
ISSN
0166-218X
Zeitschrift
DISCRETE APPLIED MATHEMATICS
Schlüsselwörter
  • Vehicle routing
  • Multiple vehicle traveling purchaser problem
  • Unitary demand
  • Incompatible products
  • Column generation
  • Dynamic-programming labeling algorithm
Paginierung
152 - 170
Datum der Veröffentlichung
2021
Status
Published
Titel
A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand
Sub types
  • Article
Ausgabe der Zeitschrift
288

Data source: Web of Science (Lite)

Other metadata sources:
Autoren
  • Nicola Bianchessi
  • Stefan Irnich
  • Christian Tilk
DOI
10.1016/j.dam.2020.08.014
ISSN
0166-218X
Zeitschrift
Discrete Applied Mathematics
Sprache
en
Paginierung
152 - 170
Datum der Veröffentlichung
2021
Status
Published
Herausgeber
Elsevier BV
Herausgeber URL
http://dx.doi.org/10.1016/j.dam.2020.08.014
Datum der Datenerfassung
2021
Titel
A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand
Ausgabe der Zeitschrift
288

Data source: Crossref

Autoren
  • Nicola Bianchessi
  • Stefan Irnich
  • Christian Tilk
DOI
10.1016/j.dam.2020.08.014
Zeitschrift
Discret. Appl. Math.
Paginierung
152 - 170
Datum der Veröffentlichung
2021
Titel
A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand.
Ausgabe der Zeitschrift
288

Data source: DBLP

Beziehungen:
Property of

Tools