Separating over Classes of TSP Inequalities Defined by 0 Node-Lifting in Polynominal Time.

Published in: IPCO (1996)

Keyphrases

facet defining
traveling salesman problem
valid inequalities
wavelet transform
sufficient conditions
search space
subtour elimination
neural network
genetic algorithm
ant colony optimization
combinatorial optimization
optimal solution
search algorithm
query processing
graph structure