The profitable close-enough arc routing problem
Year of publication: |
2022
|
---|---|
Authors: | Bianchessi, Nicola ; Corberán, Ángel ; Plana, Isaac ; Reula, Miguel ; Sanchis, José M. |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 140.2022, p. 1-14
|
Subject: | Arc routing | Branch and cut | Close-enough | Polyhedra | Profits | Tourenplanung | Vehicle routing problem | Mathematische Optimierung | Mathematical programming | Rentabilität | Profitability |
-
On the Distance-Constrained Close Enough Arc Routing Problem
Corberán, Ángel, (2021)
-
Exact solution of several families of location-arc routing problems
Fernández, Elena, (2019)
-
The generalized arc routing problem
Aráoz, Julián, (2017)
- More ...
-
The min-max close-enough arc routing problem
Bianchessi, Nicola, (2022)
-
On the Distance-Constrained Close Enough Arc Routing Problem
Corberán, Ángel, (2021)
-
A matheuristic for the Distance-Constrained Close-Enough Arc Routing Problem
Corberán, Ángel, (2019)
- More ...