Separating type-I odd-cycle inequalities for a binary-encoded edge-coloring formulation
From MaRDI portal
Publication:1774528
DOI10.1007/s10878-005-5484-3zbMath1066.90109OpenAlexW2060178757MaRDI QIDQ1774528
Jon Lee, Sven Vries, Janny M. Y. Leung
Publication date: 17 May 2005
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-005-5484-3
Related Items (6)
Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations ⋮ Total coloring and total matching: polyhedra and facets ⋮ How important are branching decisions: fooling MIP solvers ⋮ Extrapolating curvature lines in rough concept sketches using mixed-integer nonlinear optimization ⋮ Forbidden Vertices ⋮ Parsimonious binary-encoding in integer programming
Cites Work
This page was built for publication: Separating type-I odd-cycle inequalities for a binary-encoded edge-coloring formulation