A dual feasible forest algorithm for the linear assignment problem
M. Akgül, O. Ekin (1991)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “On cycling in the simplex method of the transportation problem”
A dual feasible forest algorithm for the linear assignment problem
Arbitrary weight changes in dynamic trees
Kurt Mehlhorn (1981)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
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:
Generalization of a Signature Method to Transportation Problems
Kostas Dosios, Konstantinos Paparizzos (1996)
The Yugoslav Journal of Operations Research
Similarity:
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:
Trees and meta-Fibonacci sequences.
Isgur, Abraham, Reiss, David, Tanny, Stephen (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Variations for spanning trees.
Zsakó, László (2006)
Annales Mathematicae et Informaticae
Similarity:
Splaying a search tree in preorder takes linear time.
Chaudhuri, R., Höft, H. (1991)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Skip trees, an alternative data structure to skip lists in a concurrent approach
Xavier Messeguer (1997)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
A new class of balanced search trees : half-balanced binary search tress
H. J. Olivié (1982)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
A Note on Spanning Trees for Network Location Problems
Dionisio Pérez-Brito, Nenad Mladenović, José A. Moreno-Pérez (1998)
The Yugoslav Journal of Operations Research
Similarity: