Generalized Domino-Parity Inequalities for the Symmetric Traveling Salesman Problem

DOI10.1287/MOOR.1100.0451zbMATH Open1218.90122OpenAlexW2096951656MaRDI QIDQ3169103FDOQ3169103

Daniel G. Espinoza, William Cook, Marcos Goycoolea

Publication date: 27 April 2011

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10533/143326

zbMATH Keywords

cutting planestraveling salesman problemseparating algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Combinatorial optimization (90C27) Integer programming (90C10)

Cited In (4)

• The domino inequalities: facets for the symmetric traveling salesman polytope
• The Crown Inequalities for the Symmetric Traveling Salesman Polytope
• Further contributions to network optimization
• Title not available (Why is that?)

Uses Software

• Concorde

This page was built for publication: Generalized Domino-Parity Inequalities for the Symmetric Traveling Salesman Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3169103)