Computational Experience of an Interior-Point SQP Algorithm in a Parallel Branch-and-Bound Framework-Reference-Cited by-同舟云学术

Computational Experience of an Interior-Point SQP Algorithm in a Parallel Branch-and-Bound Framework

Published:2000 Issue: Volume: Page:329-347
ISSN:1384-6485
Container-title:Applied Optimization
language:
Short-container-title:

Author:

Lee Eva K.,Mitchell John E.

Publisher

Springer US

Link

http://link.springer.com/content/pdf/10.1007/978-1-4757-3216-0_13

Reference36 articles.

1. Applegate, D., R.E. Bixby, V. Chvátal, and W. Cook. “The traveling salesman problem,” DIMACS, Rutgers University, New Brunswick, NJ, 1994.

2. Annals of Operations Research, Special Issue on Parallel Optimization;RE Bixby,1996

3. Bixby, R.E., W. Cook, A. Cox, and E.K. Lee. “Parallel mixed integer programming,” Department of Computational and Applied Mathematics, Rice University, CRPC-TR95554, Houston, Texas, 1995

4. Bixby, R.E., and E.K. Lee. “Solving a truck dispatching scheduling problem using branch-and-cut,” Operations Research, Vol. 46, pp. 355–367, 1998.

5. Boggs, P.T., P.D. Domich, and J. E. Rogers. “An interior-point method for general large scale quadratic programming problems,” Annals of Operations Research, Vol. 62, pp. 419–438, 1996. Available at ftp: http://www.math.nist.gov /pub/boggs

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Complex portfolio selection via convex mixed-integer quadratic programming: a survey;International Transactions in Operational Research;2018-04-02

2. Computational Issues;EURO Advanced Tutorials on Operational Research;2015

3. Theoretical Framework;EURO Advanced Tutorials on Operational Research;2015

4. Rebalancing and Index Tracking;EURO Advanced Tutorials on Operational Research;2015

5. Portfolio Optimization with Other Real Features;EURO Advanced Tutorials on Operational Research;2015