Solving a family of permutation problems on 0-1 matrices
Gilbert Laporte (1987)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Displaying similar documents to “A new heuristic for the traveling salesman problem”
Solving a family of permutation problems on 0-1 matrices
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:
A class of combinatorial problems with polynomially solvable large scale set covering/partitioning relaxations
M. Minoux (1987)
RAIRO - Operations Research - Recherche Opérationnelle
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:
Solving scheduling problems using Petri nets and constraint logic programming
P. Richard, C. Proust (1998)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
RedInv-SA : a simulated annealing for the quadratic assignment problem
N. M. M. de Abreu, T. M. Querido, P. O. Boaventura-Netto (1999)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Advanced search techniques for the job shop problem : a comparison
R. Tadei, F. Della Croce, G. Menga (1995)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Parametric integer programming
Paul Feautrier (1988)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Optimal tour planning with specified nodes
Gilbert Laporte, Hélène Mercure, Yves Norbert (1984)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
A locally optimal insertion heuristic for a one-machine scheduling problem
Frank Werner (1990)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity: