Chvátal Cuts and Odd Cycle Inequalities in Quadratic 0–1 Optimization
- 1 May 1992
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 5 (2) , 163-177
- https://doi.org/10.1137/0405014
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Edmonds polytopes and a hierarchy of combinatorial problemsPublished by Elsevier ,2002
- Upper-bounds for quadratic 0–1 maximizationOperations Research Letters, 1990
- On the cut polytopeMathematical Programming, 1986
- Facets of the Bipartite Subgraph PolytopeMathematics of Operations Research, 1985
- Nonlinear 0–1 programming: II. Dominance relations and algorithmsMathematical Programming, 1984
- The max-cut problem on graphs not contractible to K5Operations Research Letters, 1983
- Weakly bipartite graphs and the Max-cut problemOperations Research Letters, 1981
- A linear-time algorithm for testing the truth of certain quantified boolean formulasInformation Processing Letters, 1979
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear ProgramOperations Research, 1974
- Some Network Flow Problems Solved with Pseudo-Boolean ProgrammingOperations Research, 1965