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 | Tourenplanung | Vehicle routing problem | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Netzplantechnik | Project network techniques |
-
Khezri, Somayeh, (2023)
-
On a dual network exterior point simplex type algorithm and its computational behavior
Geranis, George, (2012)
-
Karsten, Christian Vad, (2015)
- More ...
-
An improvement heuristic framework for the laser cutting tool path problem
Dewil, Reginald, (2015)
-
Heuristics for the traveling repairman problem with profits
Dewilde, Thijs, (2013)
-
A variable neighborhood search method for the orienteering problem with hotel selection
Divsalar, Ali, (2013)
- More ...