Computing with Domino-Parity Inequalities for the Traveling Salesman Problem (TSP)

DOI10.1287/ijoc.1060.0204zbMath1241.90104OpenAlexW2135173139WikidataQ56067406 ScholiaQ56067406MaRDI QIDQ2892348

Marcos Goycoolea, Daniel G. Espinoza, William Cook

Publication date: 18 June 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.1060.0204

zbMATH Keywords

combinatorial optimizationtraveling salesman\texttt{TSPLIB}cutting-plane algorithm

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (3)

Vehicle routing for milk collection with gradual blending: a case arising in Chile ⋮ The precedence constrained knapsack problem: separating maximally violated inequalities ⋮ Path planning on a cuboid using genetic algorithms

Uses Software

• TSPLIB

This page was built for publication: Computing with Domino-Parity Inequalities for the Traveling Salesman Problem (TSP)