Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,General Decision Sciences
Reference19 articles.
1. Alidaee, B., Kochenberger, G., & Ahmadian, A. (1994). 0–1 Quadratic programming approach for the optimal solution of two scheduling problems. International Journal of Systems Science, 25, 401–408.
2. Barahona, F., Grotschel, M., Junger, M., & Reinelt, G. (1988). An application of combinatorial optimization to statistical physics and circuit layout design. Operations Research, 36(3), 493–513.
3. Bomze, I.M., Budinich, M., Pardalos, P.M., & Pelillo M. (1999). The maximum clique problem. In Handbook of Combinatorial Optimization (pp. 1–74). Springer.
4. Boros, E., & Hammer, P. L. (1991). The max-cut problem and quadratic 0–1 optimization polyhedral aspects, relaxations and bounds. Annals of Operations Research, 33(1–4), 151–180.
5. Chardaire, P., & Sutter, A. (1994). A decomposition method for quadratic zero-one programming. Management Science, 4(1), 704–712.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献