Lower bounds to the graph partitioning problem through generalized linear programming and network flows
M. Minoux, E. Pinson (1987)
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.
Displaying similar documents to “Improved lower bounds to the travelling salesman problem”
Lower bounds to the graph partitioning problem through generalized linear programming and network flows
A class of combinatorial problems with polynomially solvable large scale set covering/partitioning relaxations
M. Minoux (1987)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Lagrangean decomposition for integer programming : theory and applications
Monique Guignard, Siwhan Kim (1987)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Parametrization in nonserial dynamic programming
Umberto Bertelè, Francesco Brioschi (1971)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Analysis of a class of graph partitioning problems
P. Bertolazzi, M. Lucertini, A. Marchetti Spaccamela (1982)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
A note on optimality conditions for dual problems to the traveling salesman problem
P F. Körner (1991)
Applicationes Mathematicae
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:
A new heuristic for the traveling salesman problem
J. Carlier, P. Villon (1990)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Discrete facility location with nonlinear facility costs
Manfred Körkel (1991)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
An worst case bounded special knapsack with two constraints
Ruy E. Campello, Nelson Maculan (1988)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity: