Optimal constructions of event-node networks
Maciej M. Syslo (1981)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Maciej M. Syslo (1981)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Dimiter Ivanchev (2000)
The Yugoslav Journal of Operations Research
Similarity:
Veira Martins, Ernesto Q. (1979)
Portugaliae mathematica
Similarity:
Dimiter Ivanchev, Elena Radovanova (2009)
The Yugoslav Journal of Operations Research
Similarity:
Walkowiak, Krzysztof (2006)
Journal of Applied Mathematics and Decision Sciences
Similarity:
Meriema Belaidouni, Walid Ben-Ameur (2007)
RAIRO - Operations Research
Similarity:
The minimum cost multiple-source unsplittable flow problem is studied in this paper. A simple necessary condition to get a solution is proposed. It deals with capacities and demands and can be seen as a generalization of the well-known semi-metric condition for continuous multicommdity flows. A cutting plane algorithm is derived using a superadditive approach. The inequalities considered here are valid for single knapsack constraints. They are based on nondecreasing superadditive functions...
Krzysztof Walkowiak (2005)
International Journal of Applied Mathematics and Computer Science
Similarity:
This work introduces ANB (bf Ant Algorithm for bf Non-bf Bifurcated Flows), a novel approach to capacitated static optimization of flows in connection-oriented computer networks. The problem considered arises naturally from several optimization problems that have recently received significant attention. The proposed ANB is an ant algorithm motivated by recent works on the application of the ant algorithm to solving various problems related to computer networks. However, few works concern...
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...
Pierre Hansen, Maolin Zheng (1991)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Dimiter Ivanchev (1995)
The Yugoslav Journal of Operations Research
Similarity:
George Geranis, Konstantinos Paparrizos, Angelo Sifaleras (2009)
The Yugoslav Journal of Operations Research
Similarity: