Branch-price-and-cut for the soft-clustered capacitated arc-routing problem
Year of publication: |
2021
|
---|---|
Authors: | Hintsch, Timo ; Irnich, Stefan ; Christensen, Lone Kiilerich |
Published in: |
Transportation science : a journal of the Institute for Operations Research and the Management Sciences. - Catonsville, MD : Transportation Science & Logistics Society of the Institute for Operations Research and the Management Sciences, ISSN 0041-1655, ZDB-ID 160958-0. - Vol. 55.2021, 3, p. 687-705
|
Subject: | arc routing | branch-price-and-cut | branch-and-cut | districting | Tourenplanung | Vehicle routing problem | Ganzzahlige Optimierung | Integer programming |
-
An approach to the asymmetric multi-depot capacitated arc routing problem
Krushnisky, Dmitry, (2015)
-
A branch-and-cut algorithm for the profitable windy rural postman problem
Ávila, Thais, (2016)
-
Multi-vehicle prize collecting arc routing for connectivity problem
Akbari, Vahid, (2017)
- More ...
-
Exact solution of the soft-clustered vehicle-routing problem
Hintsch, Timo, (2020)
-
Large multiple neighborhood search for the clustered vehicle-routing problem
Hintsch, Timo, (2018)
-
Decision problems related to fleet composition and routing
Christensen, Lone Kiilerich, (2019)
- More ...