An exact solution method for unconstrained quadratic 0–1 programming: a geometric approach
| Year of publication: |
2012
|
|---|---|
| Authors: | Li, D. ; Sun, X. ; Liu, C. |
| Published in: |
Journal of Global Optimization. - Springer. - Vol. 52.2012, 4, p. 797-829
|
| Publisher: |
Springer |
| Subject: | Quadratic 0–1 programming | Nonlinear integer programming | Optimality condition | Lower bounds | Variable fixation | Branch-and-bound method |
-
Using a Conic Bundle method to accelerate both phases of a quadratic convex reformulation
Billionnet, Alain, (2017)
-
Algorithms for the minimum spanning tree problem with resource allocation
Kataoka, Seiji, (2016)
-
Optimal Scheduling of a Two-stage Hybrid Flow Shop
Haouari, Mohamed, (2006)
- More ...
-
On duality gap in binary quadratic programming
Sun, X., (2012)
-
Time-frequency comovements between sovereign CDS and exchange rates : the role of sentiments
Liu, Chang, (2023)
-
Investor sentiment and the Chinese new energy stock market : a risk-return perspective
Shen, Yiran, (2023)
- More ...