A solvable case of quadratic 0–1 programming
- 31 January 1986
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 13 (1) , 23-26
- https://doi.org/10.1016/0166-218x(86)90065-x
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Roof duality, complementation and persistency in quadratic 0–1 optimizationMathematical Programming, 1984
- The indefinite zero-one quadratic problemDiscrete Applied Mathematics, 1984
- The max-cut problem on graphs not contractible to K5Operations Research Letters, 1983
- Polytope des independants d'un graphe serie-paralleleDiscrete Mathematics, 1979
- Methods of Nonlinear 0-1 ProgrammingAnnals of Discrete Mathematics, 1979
- Minimum cuts and related problemsNetworks, 1975
- On certain polytopes associated with graphsJournal of Combinatorial Theory, Series B, 1975
- Some Network Flow Problems Solved with Pseudo-Boolean ProgrammingOperations Research, 1965
- Topology of series-parallel networksJournal of Mathematical Analysis and Applications, 1965