한국경영과학회:학술대회논문집 (Proceedings of the Korean Operations and Management Science Society Conference)
- 대한산업공학회/한국경영과학회 2004년도 춘계공동학술대회 논문집
- /
- Pages.107-110
- /
- 2004
Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra
초록
We present a unifying framework to establish a lower-bound on the number of semidefinite programming based, lift-and-project iterations (rank) for computing the convex hull of the feasible solutions of various combinatorial optimization problems. This framework is based on the maps which are commutative with the lift-and-project operators. Some special commutative maps were originally observed by
키워드