Parallel branch and bound algorithms for quadratic zero–one programs on the hypercube architecture
暂无分享,去创建一个
[1] Peter L. Hammer,et al. Boolean Methods in Operations Research and Related Areas , 1968 .
[2] H. D. Ratliff,et al. Minimum cuts and related problems , 1975, Networks.
[3] P. Hansen. Methods of Nonlinear 0-1 Programming , 1979 .
[4] Francisco Barahona,et al. A solvable case of quadratic 0-1 programming , 1986, Discret. Appl. Math..
[5] John P. Hayes,et al. Architecture of a Hypercube Supercomputer , 1986, ICPP.
[6] 茨木 俊秀,et al. Enumerative approaches to combinatorial optimization , 1987 .
[7] Catherine Roucairol,et al. A parallel branch and bound algorithm for the quadratic assignment problem , 1987, Discret. Appl. Math..
[8] Richard M. Karp,et al. A randomized parallel branch-and-bound procedure , 1988, STOC '88.
[9] B. Gillett,et al. A parallel integer linear programming algorithm , 1988 .
[10] T. Ibaraki. Enumerative approaches to combinatorial optimization - part I , 1988 .
[11] E. W. Felten,et al. Best-first branch-and bound on a hypercube , 1989, C3P.
[12] K. Schwan,et al. Process and workload migration for a parallel branch-and-bound algorithm on a hypercube multicomputer , 1989, C3P.
[13] T. N. Mudge,et al. Parallel branch and bound algorithms on hypercube multiprocessors , 1989, C3P.
[14] R. P. Ma,et al. A dynamic load balancer for a parallel branch and bound algorithm , 1989, C3P.
[15] R. P. Pargas,et al. Branch-and-bound algorithms on a hypercube , 1989, C3P.
[16] P. Pardalos,et al. Graph separation techniques for quadratic zero-one programming , 1991 .