Login / Signup
Using path inequalities in a branch and cut code for the symmetric traveling salesman problem.
Jean-Maurice Clochard
Denis Naddef
Published in:
IPCO (1993)
Keyphrases
</>
source code
linear inequalities
shortest path
sufficient conditions
wireless sensor networks
data mining
information retrieval
artificial intelligence
information systems
optimal path
error correcting
planar graphs
mixed integer linear programs