The boolean quadric polytope: Some characteristics, facets and relatives
- 1 August 1989
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 45 (1-3) , 139-172
- https://doi.org/10.1007/bf01589101
Abstract
No abstract availableKeywords
This publication has 33 references indexed in Scilit:
- On the cut polytopeMathematical Programming, 1986
- A solvable case of quadratic 0–1 programmingDiscrete Applied Mathematics, 1986
- Facets of the Bipartite Subgraph PolytopeMathematics of Operations Research, 1985
- Nonlinear 0–1 programming: I. Linearization techniquesMathematical Programming, 1984
- The perfectly matchable subgraph polytope of a bipartite graphNetworks, 1983
- Polytope des independants d'un graphe serie-paralleleDiscrete Mathematics, 1979
- Set Partitioning: A surveySIAM Review, 1976
- On the Set-Covering ProblemOperations Research, 1972
- Notes—On a Selection ProblemManagement Science, 1970
- Characterization of totally unimodular matricesProceedings of the American Mathematical Society, 1965