×

Cardinality constrained Boolean quadratic polytope. (English) Zbl 0898.90092

Summary: We study the polyhedral structure of an integer programming formulation of the cardinality constrained Boolean quadratic problem. We give many facet-defining inequalities. The separation problems for these inequalities appear to be difficult, which explains, in part, the difficulty encountered in solving these problems via a branch-and-cut methodology. As a special case of these inequalities, we obtain some previously known inequalities for the equipartition problem.

MSC:

90C09 Boolean programming
90C20 Quadratic programming
PDFBibTeX XMLCite
Full Text: DOI Link

References:

[1] Barahona, F.; Casari, A., On the magnetisation of the ground states in two dimensional Ising spin glasses, Comput. Phys. Comm., 49, 417-421 (1988) · Zbl 0814.90132
[2] Barahona, F.; Majhoub, R., On the cut polytope, Math. Programming, 36, 157-173 (1986) · Zbl 0616.90058
[3] Chopra, S., The graph partitioning polytope on series-parallel and 4-wheel free graphs, SIAM J. Discrete Math., 7, 16-22 (1994) · Zbl 0797.05073
[4] Chopra, S.; Rao, M. R., The partition problem, Math. Programming, 59, 87-115 (1993) · Zbl 0774.90082
[5] Chopra, S.; Rao, M. R., Facets of the \(k\)-partition polytope, Discrete Appl. Math., 61, 27-48 (1995) · Zbl 0835.90075
[6] Conforti, M.; Rao, M. R.; Sassano, A., The equipartition polytope I, Math. Programming, 49, 49-70 (1990) · Zbl 0718.90092
[7] Conforti, M.; Rao, M. R.; Sassano, A., The equipartition polytope II, Math. Programming, 49, 71-90 (1990) · Zbl 0718.90093
[8] De Simone, C., The cut polytope and the Boolean quadric polytope, Discrete Math., 79, 71-75 (1990) · Zbl 0683.90068
[9] Johnson, E. L.; Mehrotra, A.; Nemhauser, G. L., Min-cut clustering, Math. Programming, 62, 133-151 (1993) · Zbl 0807.90117
[10] Mehrotra, A., Constrained graph partitioning: decomposition, polyhedral structure and algorithms, (Ph.D. Dissertation (1992), School of Industrial and Systems Engineering, Georgia Institute of Technology)
[11] Mehrotra, A., Polyhedral results for constrained Boolean quadric polytope (1995), Department of Management Science, University of Miami
[12] Nemhauser, G. L.; Wolsey, L. A., Integer and Combinatorial Optimization (1988), Wiley: Wiley New York · Zbl 0469.90052
[13] Padberg, M., The Boolean quadric polytope: some characteristics, facets and relatives, Math. Programming B, 45, 139-172 (1989) · Zbl 0675.90056
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.