Parallel branch and bound algorithms for quadratic zero–one programs on the hypercube architecture
Authors:
- 1 December 1990
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 22 (1) , 271-292
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Graph separation techniques for quadratic zero-one programmingComputers & Mathematics with Applications, 1991
- A parallel integer linear programming algorithmEuropean Journal of Operational Research, 1988
- A randomized parallel branch-and-bound procedure1988
- A parallel branch and bound algorithm for the quadratic assignment problemDiscrete Applied Mathematics, 1987
- Constrained Global Optimization: Algorithms and Applications1987
- A solvable case of quadratic 0–1 programmingDiscrete Applied Mathematics, 1986
- Methods of Nonlinear 0-1 Programming1979
- Minimum cuts and related problemsNetworks, 1975
- Boolean Methods in Operations Research and Related Areas1968