Criterion of distance between technical programming and socio-economic priority
B. Roy, R. Slowinski (1993)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
B. Roy, R. Slowinski (1993)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
F. Plastria (1991)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Pierre Hansen, Martine Labbé, Jacques-François Thisse (1991)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Giancarlo Pesamosca (1998)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Amitava Dutta, Howard J. Siegel, Andrew B. Whinston (1983)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Jerzy Kamburowski (1985)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
A. C. Garavelli, P. Pontrandolfo (1995)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
José A. Moreno Pérez, Belén Melián Batista, Manuel Laguna (2005)
The Yugoslav Journal of Operations Research
Similarity:
Juan A. Mesa (1991)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
T. Brian Boffey, R. C. Williams, B. Pelegrín, P. Fernandez (2002)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Individual items of flow in a telecommunications or a transportation network may need to be separated by a minimum distance or time, called a “headway”. If link dependent, such restrictions in general have the effect that the minimum time path for a “convoy” of items to travel from a given origin to a given destination will depend on the size of the convoy. The Quickest Path problem seeks a path to minimise this convoy travel time. A closely related bicriterion problem is the Maximum...