The min-max close-enough arc routing problem
Year of publication: |
2022
|
---|---|
Authors: | Bianchessi, Nicola ; Corberán, Ángel ; Plana, Isaac ; Reula, Miguel ; Sanchis, José M. |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 300.2022, 3 (1.8.), p. 837-851
|
Subject: | Branch-and-cut | Branch-and-price | Close-enough arc routing problem | Min-max | Routing | Tourenplanung | Vehicle routing problem | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
-
Exact solution of the soft-clustered vehicle-routing problem
Hintsch, Timo, (2020)
-
Ávila, Thais, (2017)
-
Branch-and-price and constraint programming for solving real-life technician dispatching problem
Cortés, Cristian E., (2014)
- More ...
-
The profitable close-enough arc routing problem
Bianchessi, Nicola, (2022)
-
A matheuristic for the Distance-Constrained Close-Enough Arc Routing Problem
Corberán, Ángel, (2019)
-
On the Distance-Constrained Close Enough Arc Routing Problem
Corberán, Ángel, (2021)
- More ...