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 search session has expired. Please query the service again.
The search session has expired. Please query the service again.
George Geranis, Konstantinos Paparrizos, Angelo Sifaleras (2009)
The Yugoslav Journal of Operations Research
Similarity:
Walkowiak, Krzysztof (2006)
Journal of Applied Mathematics and Decision Sciences
Similarity:
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...
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...
Sokkalingam, P.T., Sharma, Prabha (2005)
Journal of Applied Mathematics and Decision Sciences
Similarity:
Brian Boffey (1993)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Maric, Miroslav (2013)
Serdica Journal of Computing
Similarity:
In this paper a Variable Neighborhood Search (VNS) algorithm for solving the Capacitated Single Allocation Hub Location Problem (CSAHLP) is presented. CSAHLP consists of two subproblems; the first is choosing a set of hubs from all nodes in a network, while the other comprises finding the optimal allocation of non-hubs to hubs when a set of hubs is already known. The VNS algorithm was used for the first subproblem, while the CPLEX solver was used for the second. Computational results...
Dimiter Ivanchev (2000)
The Yugoslav Journal of Operations Research
Similarity:
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...
Zbigniew Tarapata (2007)
International Journal of Applied Mathematics and Computer Science
Similarity:
The paper presents selected multicriteria (multiobjective) approaches to shortest path problems. A classification of multi-objective shortest path (MOSP) problems is given. Different models of MOSP problems are discussed in detail. Methods of solving the formulated optimization problems are presented. An analysis of the complexity of the presented methods and ways of adapting of classical algorithms for solving multiobjective shortest path problems are described. A comparison of the...
Dimiter Ivanchev, Elena Radovanova (2009)
The Yugoslav Journal of Operations Research
Similarity: