The hierarchical mixed rural postman problem : polyhedral analysis and a branch-and-cut algorithm
| Year of publication: |
16 February 2017
|
|---|---|
| Authors: | Colombi, Marco ; Corberán, Ángel ; Mansini, Renata ; Plana, Isaac ; Sanchis, José M. |
| Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 257.2017, 1 (16.2.), p. 1-12
|
| Subject: | Hierarchical Routing Problems | Mixed Rural Postman Problem | Branch-and-cut | Polyhedral analysis | Tourenplanung | Vehicle routing problem | Theorie | Theory | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming |
-
A branch-and-cut algorithm for the multidepot rural postman problem
Fernández, Elena, (2018)
-
Exact approaches for the minimum subgraph diameter problem
Dadalto, Arthur Pratti, (2023)
-
Gouveia, Luis, (2017)
- More ...
-
The hierarchical mixed rural postman problem
Colombi, Marco, (2017)
-
The directed profitable rural postman problem with incompatibility constraints
Colombi, Marco, (2017)
-
On the Distance-Constrained Close Enough Arc Routing Problem
Corberán, Ángel, (2021)
- More ...