From the median to the generalized center
Pierre Hansen, Martine Labbé, Jacques-François Thisse (1991)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Displaying similar documents to “The variance location problem on a network with continuously distributed demand”
From the median to the generalized center
Multiperiod medians on networks
Juan A. Mesa (1991)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
An algorithm for the minimum variance point of a network
Pierre Hansen, Maolin Zheng (1991)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Non-planar network with edges subject to failure and enumeration of proper cuts
P. J. Doulliez, M. R. Rao (1973)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
On the distributed decision-making complexity of the minimum vertex cover problem
Pierluigi Crescenzi, Luca Trevisan (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
The Variance Location Problem on a Network with Continuously distributed demand
Ma Cruz López de los Mozos, Juan A. Mesa (2010)
RAIRO - Operations Research
Similarity:
Most location problems on networks consider discrete nodal demand. However, for many problems, demands are better represented by continuous functions along the edges, in addition to nodal demands. Several papers consider the optimal location problem of one or more facilities when demands are continuously distributed along the network, and the objective function dealt with is the median one. Nevertheless, in location of public services it is desirable to use an equity criterion. One...
Reliability of communication networks with delay constraints: computational complexity and complete topologies.
Cancela, H., Petingi, L. (2004)
International Journal of Mathematics and Mathematical Sciences
Similarity:
The Capacitated Arc Routing Problem. A heuristic algorithm.
Enrique. Benavent, V. Campos, Angel Corberán, Enrique Mota (1990)
Qüestiió
Similarity:
In this paper we consider the Capacitated Arc Routing Problem, in which a fleet of K vehicles, all of them based on a specific vertex (the depot) and with a known capacity Q, must service a subset of the edges of the graph, with minimum total cost and such that the load assigned to each vehicle does not exceed its capacity. A heuristic algorithm for this problem is proposed consisting of: the selection of K centers, the construction of K connected graphs with associated loads...
Sum-Of-Squares Clustering on Networks
Emilio Carrizosa, Nenad Mladenović, Raca Todosijević (2011)
The Yugoslav Journal of Operations Research
Similarity:
Scheduled hot-potato routing.
Naor, Joseph, Orda, Ariel, Rom, Raphael (1998)
Journal of Graph Algorithms and Applications
Similarity:
Lexicographic -robustness: an application to the 1-median problem
R. Kalaï, M. A. Aloulou, Ph. Vallin, D. Vanderpooten (2010)
RAIRO - Operations Research
Similarity:
In the last decade, several robustness approaches have been developed to deal with uncertainty. In decision problems, and particularly in location problems, the most used robustness approach rely either on maximal cost or on maximal regret criteria. However, it is well known that these criteria are too conservative. In this paper, we present a new robustness approach, called , which compensates for the drawbacks of criteria based on the worst case. We apply this approach to the 1-median...