Mar 1, 2002 · We introduce several new “one-pass” heuristics for solving very large versions of this problem. Our computational experience on problems of up to 9000 variables
These various studies approach the problem by branch and bound, decomposition, tabu search, simulated annealing, and evolutionary methods such as genetic ...
In response to this need, we introduce several new “one-pass” heuristics for solving very large versions of this problem. Our computational experience on ...
One-pass heuristics for large-scale unconstrained binary quadratic ...
ideas.repec.org › eee › ejores
"One-pass heuristics for large-scale unconstrained binary quadratic problems," European Journal of Operational Research, Elsevier, vol. 137(2), pages 272-287, ...
Kochenberger, One-pass heuristics for large-scale unconstrained binary quadratic programs. EJOR 137, 272–287 (2002). Article MathSciNet MATH Google Scholar. F ...
Glover F, Alidaee B, Rego C, Kochenberger G (2002) One-pass heuristics for large-scale unconstrained binary quadratic problems. Eur J Oper Res 137(2):272 ...
One-pass heuristics for large-scale unconstrained binary quadratic problems. F Glover, B Alidaee, C Rego, G Kochenberger. European Journal of Operational ...
This work proposes several versions of the DDT constructive heuristic based on the alternative representation of the quadratic function and presents an ...
We present two heuristic algorithms based upon tabu search and simulated annealing for this problem. Computational results are presented for a number of ...
Missing: pass | Show results with:pass
Jun 8, 2011 · We propose several versions of the DDT constructive heuristic based on the alternative representation of the quadratic function. We also present ...