A minimum cost network flow model for the maximum covering and patrol routing problem
Year of publication: |
2015
|
---|---|
Authors: | Dewil, Reginald ; Vansteenwegen, Pieter ; Cattrysse, Dirk G. ; Van Ousheusden, D. |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 247.2015, 1 (1.11.), p. 27-36
|
Subject: | Routing | Problem structuring | Minimum Cost Network Flow Problem | Multi-commodity | Theorie | Theory | Tourenplanung | Vehicle routing problem | Mathematische Optimierung | Mathematical programming |
-
An improved formulation for the maximum coverage patrol routing problem
Çapar, İbrahim, (2015)
-
The data transfer problem in a system of systems
Bocquillon, Ronan, (2015)
-
Minimizing takeoff and landing risk in helicopter pickup and delivery operations
Gribkovskaia, Irina, (2015)
- More ...
-
An improvement heuristic framework for the laser cutting tool path problem
Dewil, Reginald, (2015)
-
Construction heuristics for generating tool paths for laser cutters
Dewil, Reginald, (2014)
-
Peng, Guansheng, (2019)
- More ...