Binary clutter inequalities for integer programs

DOI10.1007/s10107-003-0402-xzbMath1082.90069OpenAlexW2025803800WikidataQ57702337 ScholiaQ57702337MaRDI QIDQ1424294

Adam N. Letchford

Publication date: 11 March 2004

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-003-0402-x

zbMATH Keywords

traveling salesman problemcutting planesmatroid theorybinary clutters

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Related Items (4)

On the membership problem for the \({0, 1/2}\)-closure ⋮ Optimization with binet matrices ⋮ How tight is the corner relaxation? ⋮ On the complexity of surrogate and group relaxation for integer linear programs

This page was built for publication: Binary clutter inequalities for integer programs