Computational aspects of a branch and bound algorithm for quadratic zero-one programming
- 1 June 1990
- journal article
- Published by Springer Science and Business Media LLC in Computing
- Vol. 45 (2), 131-144
- https://doi.org/10.1007/bf02247879
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Experiments in quadratic 0–1 programmingMathematical Programming, 1989
- A solvable case of quadratic 0–1 programmingDiscrete Applied Mathematics, 1986
- The indefinite zero-one quadratic problemDiscrete Applied Mathematics, 1984
- Unconstrained quadratic bivalent programming problemEuropean Journal of Operational Research, 1984
- An improved enumerative algorithm for solving quadratic zero-one programmingEuropean Journal of Operational Research, 1984
- An efficient branch and bound algorithm to solve the quadratic integer programming problemComputing, 1983
- Quadratic knapsack problemsMathematical Programming Studies, 1980
- Methods of Nonlinear 0-1 ProgrammingAnnals of Discrete Mathematics, 1979
- Computer-aided layout designPublished by Springer Science and Business Media LLC ,1978
- Minimum cuts and related problemsNetworks, 1975