Graph separation techniques for quadratic zero-one programming
- 1 January 1991
- journal article
- research article
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 21 (6-7), 107-113
- https://doi.org/10.1016/0898-1221(91)90165-z
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Constrained Global Optimization: Algorithms and ApplicationsPublished by Springer Nature ,1987
- A solvable case of quadratic 0–1 programmingDiscrete Applied Mathematics, 1986
- Unconstrained quadratic bivalent programming problemEuropean Journal of Operational Research, 1984
- Applications of a Planar Separator TheoremSIAM Journal on Computing, 1980
- An Implicit Enumeration Algorithm for Quadratic Integer ProgrammingManagement Science, 1980
- A Separator Theorem for Planar GraphsSIAM Journal on Applied Mathematics, 1979
- Methods of Nonlinear 0-1 ProgrammingAnnals of Discrete Mathematics, 1979
- Computer-aided layout designPublished by Springer Nature ,1978
- Some simplified NP-complete graph problemsTheoretical Computer Science, 1976
- Minimum cuts and related problemsNetworks, 1975