On the parallel complexity of the alternating hamiltonian cycle problem
E. Bampis, Y. Manoussakis, I. Milis (1999)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Displaying similar documents to “Computational comparison of two methods for finding the shortest complete cycle or circuit in a graph”
On the parallel complexity of the alternating hamiltonian cycle problem
A new heuristic for the traveling salesman problem
J. Carlier, P. Villon (1990)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Simulated annealing algorithm : technical improvements
D. Delamarre, B. Virot (1998)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Mathematical Models and a Constructive Heuristic for Finding Minimum Fundamental Cycle Bases
Leo Liberti, Edoardo Amaldi, Francesco Maffioli, Nelson Maculan (2005)
The Yugoslav Journal of Operations Research
Similarity:
Prescribed ultrametrics
J. Higgins, D. Campbell (1993)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Optimal scheduling of material handling devices in a PCB production line: problem formulation and a polynomial algorithm.
Che, Ada, Chu, Chengbin (2008)
Mathematical Problems in Engineering
Similarity:
Subgradient optimization and large scale programming : an application to optimum multicommodity network synthesis with security constraints
M. Minoux, J. Y. Serreault (1981)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
The Hamilton circuit problem on grids
Foto Afrati (1994)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
A class of combinatorial problems with polynomially solvable large scale set covering/partitioning relaxations
M. Minoux (1987)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Planar graphs with topological constraints.
Dornheim, Christoph (2002)
Journal of Graph Algorithms and Applications
Similarity: