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 “An algorithm for the minimum variance point of a network”
From the median to the generalized center
The variance location problem on a network with continuously distributed demand
Ma Cruz López De Los Mozos, Juan A. Mesa (2000)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
A problem of finding an acceptable variant in generalized project networks.
Blokh, David, Gutin, Gregory, Yeo, Anders (2005)
Journal of Applied Mathematics and Decision Sciences
Similarity:
Multiperiod medians on networks
Juan A. Mesa (1991)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Realization of Knapsack Problem Solving Algorithm and some of Its Applications
Dimiter Ivanchev, Elena Radovanova (2009)
The Yugoslav Journal of Operations Research
Similarity:
A non improving simplex algorithm for transportation problems
Konstantinos Paparrizos (1996)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
The all-to-all alternative route problem
Brian Boffey (1993)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
On the minimum dummy-arc problem
David J. Michael, Jerzy Kamburowski (1993)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Optimal constructions of event-node networks
Maciej M. Syslo (1981)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
A Dual Exterior Point Simplex Type Algorithm for the Minimum Cost Network Flow Problem
George Geranis, Konstantinos Paparrizos, Angelo Sifaleras (2009)
The Yugoslav Journal of Operations Research
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...
Quasi-hierarchical evolution algorithm for flow assignment in survivable connection-oriented networks
Michal Przewozniczek, Krzysztof Walkowiak (2006)
International Journal of Applied Mathematics and Computer Science
Similarity:
The main objective of this paper is to develop an effective evolutionary algorithm (EA) for the path-assignment problem in survivable connection-oriented networks. We assume a single-link failure scenario, which is the most common and frequently reported failure event. Since the network flow is modeled as a non-bifurcated multicommodity flow, the discussed optimization problem is NP-complete. Thus, we develop an effective heuristic algorithm based on an evolutionary algorithm. The main...