Criterion of distance between technical programming and socio-economic priority
B. Roy, R. Slowinski (1993)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Bi-directional nearness in a network by AHP (Analytic Hierarchy Process) and ANP (Analytic Network Process)”
Criterion of distance between technical programming and socio-economic priority
Optimal gridpositioning or single facility location on the torus
F. Plastria (1991)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
From the median to the generalized center
Pierre Hansen, Martine Labbé, Jacques-François Thisse (1991)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
On the solution of a class of location problems. A sample problem
Giancarlo Pesamosca (1998)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
On the application of parallel architectures to a class of operations research problems
Amitava Dutta, Howard J. Siegel, Andrew B. Whinston (1983)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Two-point approximations for activity times in PERT networks
Jerzy Kamburowski (1985)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
A heuristic method for the estimation of the project duration in a stochastic network scheduling
A. C. Garavelli, P. Pontrandolfo (1995)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Scatter Search Based Metaheuristic for Robust Optimization of the Deploying Of “Dwdm” Technology on Optical Networks With Survivability
José A. Moreno Pérez, Belén Melián Batista, Manuel Laguna (2005)
The Yugoslav Journal of Operations Research
Similarity:
Multiperiod medians on networks
Juan A. Mesa (1991)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
The maximum capacity shortest path problem : generation of efficient solution sets
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...