Computational study of a family of mixed-integer quadratic programming problems

Daniel Bienstock

doi:10.1007/bf02592208

journal article Aug 01, 1996

Computational study of a family of mixed-integer quadratic programming problems

Daniel Bienstock

Mathematical Programming Vol. 74 No. 2 pp. 121-140 · Springer Science and Business Media LLC

View at Publisher Save 10.1007/bf02592208

Topics

No keywords indexed for this article. Browse by subject →

References

16

[1]

E. Balas, Intersection cuts—a new type of cutting planes for integer programming.Operations Research 19 (1971) 19–39. 10.1287/opre.19.1.19

[2]

E. Balas, S. Ceria and G. Cornuéjols. A lift-and-project cutting plane algorithm for mixed 0–1 programs,Mathematical Programming 58 (1993) 295–324. 10.1007/bf01581273

[3]

E. Balas, S. Ceria and G. Cornuéjols. Mixed 0–1 programming by lift-and-project in a branch-and-cut framework,Management Science (to appear).

[4]

W. Cook, personal communication.

[5]

R. Bixby, personal communication.

[6]

R. Bixby, W.J. Cook, A. Cox and E. Lee, Parallel mixed-integer programming, manuscript (1994).

[7]

Cplex Optimization, Inc.

[8]

J. Eckstein, Parallel branch-and-bound algorithms for general mixed integer programming on the CM-5,SIAM Journal on Optimization 4 (1994) 794–814. 10.1137/0804046

[9]

R. Fletcher,Practical Methods of Optimization, Vol. 2 (Wiley, 1981).

[10]

H. Konno and K. Suzuki, A fast algorithm for solving large scale mean-variance models by compact factorization of covariance matrices, Report IHSS 91-32, Institute of Human and Social Sciences, Tokyo Institute of Technology (1991).

[11]

G.L. Nemhauser and L.A. Wolsey,Integer and Combinatorial Optimization (Wiley, New York, 1988). 10.1002/9781118627372

[12]

D.G. Luenberger,Linear and Nonlinear Programming (Addison Wesley, 1984).

[13]

A.F. Perold, Large-scale protfolio optimization,Management Science 30 (1984) 1143–1160. 10.1287/mnsc.30.10.1143

[14]

M. Savelsbergh, personal communication (1995).

[15]

L.A. Wolsey, personal communication.

[16]

R.J. Vanderbei and T.J. Carpenter, Symmetric indefinite systems for interior point methods,Mathematical Programming 58 (1993) 1–32. 10.1007/bf01581257

Metrics

248

Citations

16

References

Details

Published: Aug 01, 1996
Vol/Issue: 74(2)
Pages: 121-140
License: View

Authors

D

Daniel Bienstock

Cite This Article

Daniel Bienstock (1996). Computational study of a family of mixed-integer quadratic programming problems. Mathematical Programming, 74(2), 121-140. https://doi.org/10.1007/bf02592208

Computational study of a family of mixed-integer quadratic programming problems

You May Also Like