The maximum covering/shortest path problem : a multiobjective network design and routing formulation
Year of publication: |
1985
|
---|---|
Authors: | Current, J. R. ; ReVelle, C. S. ; Cohon, J. L. |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 24.1985, 2, p. 189-199
|
Subject: | Netzwerkanalyse | Unternehmensforschung | Reihenfolgeproblem | Programmanalyse ganzzahlig | Tourenplanung | Vehicle routing problem | Graphentheorie | Graph theory | Multikriterielle Entscheidungsanalyse | Multi-criteria analysis | Ganzzahlige Optimierung | Integer programming |
-
Optimal capacitated ring trees
Hill, Alessandro, (2016)
-
Speeding up Martins' algorithm for multiple objective shortest path problems
Demeyer, Sofie, (2013)
-
An exact method for the biobjective shortest path problem for large-scale road networks
Duque, Daniel, (2015)
- More ...
-
The maximum covering/shortest path problem: A multiobjective network design and routing formulation
Current, J. R., (1985)
-
Heuristic concentration and Tabu search: A head to head comparison
Rosing, K. E., (1998)
-
Heuristic concentration: Two stage solution construction
Rosing, K. E., (1997)
- More ...