A Study of Domino-Parity and k-Parity Constraints for the TSP
From MaRDI portal
Publication:3596350
DOI10.1007/11496915_33zbMath1119.90358OpenAlexW1819019791MaRDI QIDQ3596350
Marcos Goycoolea, Daniel G. Espinoza, William Cook
Publication date: 30 August 2007
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11496915_33
Related Items
Traveling salesman problem with clustering, Exploiting planarity in separation routines for the symmetric traveling salesman problem
Uses Software