Polyhedral Results for 1-Restricted Simple 2-Matchings

DOI10.1137/070697409zbMath1218.05133OpenAlexW2015084469MaRDI QIDQ3395008

Yanjun Li, David B. Hartvigsen

Publication date: 20 August 2009

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/070697409

zbMATH Keywords

combinatorial optimizationtraveling salesman problemmatchingspolyhedral combinatorics

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

This page was built for publication: Polyhedral Results for 1-Restricted Simple 2-Matchings