A non-dual signature method for the assignment problem and a generalization of the dual simplex method for the transportation problem
Konstantinos Paparrizos (1988)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Displaying similar documents to “A dual feasible forest algorithm for the linear assignment problem”
A non-dual signature method for the assignment problem and a generalization of the dual simplex method for the transportation problem
Canonical decomposition of outerplanar maps and application to enumeration, coding and generation.
Bonichon, Nicolas, Gavoille, Cyril, Hanusse, Nicolas (2005)
Journal of Graph Algorithms and Applications
Similarity:
Variations for spanning trees.
Zsakó, László (2006)
Annales Mathematicae et Informaticae
Similarity:
A non improving simplex algorithm for transportation problems
Konstantinos Paparrizos (1996)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Computing an optimal orientation of a balanced decomposition tree for linear arrangement problems.
Bar-Yehuda, Reuven, Even, Guy, Feldmann, Jon, Naor, Joseph (2001)
Journal of Graph Algorithms and Applications
Similarity:
Optimal tour planning with specified nodes
Gilbert Laporte, Hélène Mercure, Yves Norbert (1984)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
A probabilistic analysis of a new satisfiability algorithm
B. Apolloni, S. Di Gregorio (1982)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Approximation algorithms for metric tree cover and generalized tour and tree covers
Viet Hung Nguyen (2007)
RAIRO - Operations Research
Similarity:
Given a weighted undirected graph , a tree (respectively tour) cover of an edge-weighted graph is a set of edges which forms a tree (resp. closed walk) and covers every other edge in the graph. The tree (resp. tour) cover problem is of finding a minimum weight tree (resp. tour) cover of . Arkin, Halldórsson and Hassin (1993) give approximation algorithms with factors respectively 3.5 and 5.5. Later Könemann, Konjevod, Parekh, and Sinha (2003) study the linear programming relaxations...
The color-balanced spanning tree problem
Štefan Berežný, Vladimír Lacko (2005)
Kybernetika
Similarity:
Suppose a graph whose edges are partitioned into disjoint categories (colors) is given. In the color-balanced spanning tree problem a spanning tree is looked for that minimizes the variability in the number of edges from different categories. We show that polynomiality of this problem depends on the number of categories and present some polynomial algorithm.