Cardinality constrained Boolean quadratic polytope

Discrete Applied Mathematics - Tập 79 - Trang 137-154 - 1997
Anuj Mehrotra1
1Department of Management Science, University of Miami, Coral Gables, FL 33124-8237, USA

Tài liệu tham khảo

Barahona, 1988, On the magnetisation of the ground states in two dimensional Ising spin glasses, Comput. Phys. Comm., 49, 417, 10.1016/0010-4655(88)90002-1 Barahona, 1986, On the cut polytope, Math. Programming, 36, 157, 10.1007/BF02592023 Chopra, 1994, The graph partitioning polytope on series-parallel and 4-wheel free graphs, SIAM J. Discrete Math., 7, 16, 10.1137/S0895480191199415 Chopra, 1993, The partition problem, Math. Programming, 59, 87, 10.1007/BF01581239 Chopra, 1995, Facets of the k-partition polytope, Discrete Appl. Math., 61, 27, 10.1016/0166-218X(93)E0175-X Conforti, 1990, The equipartition polytope I, Math. Programming, 49, 49, 10.1007/BF01588778 Conforti, 1990, The equipartition polytope II, Math. Programming, 49, 71, 10.1007/BF01588779 De Simone, 1990, The cut polytope and the Boolean quadric polytope, Discrete Math., 79, 71, 10.1016/0012-365X(90)90056-N Johnson, 1993, Min-cut clustering, Math. Programming, 62, 133, 10.1007/BF01585164 Mehrotra, 1992, Constrained graph partitioning: decomposition, polyhedral structure and algorithms Mehrotra, 1995 Nemhauser, 1988 Padberg, 1989, The Boolean quadric polytope: some characteristics, facets and relatives, Math. Programming B, 45, 139, 10.1007/BF01589101