The Persistence and Effectiveness of Large-Scale Mathematical Programming Strategies: Projection, Outer Linearization, and Inner Linearization-Reference-Cited by-同舟云学术

The Persistence and Effectiveness of Large-Scale Mathematical Programming Strategies: Projection, Outer Linearization, and Inner Linearization

Published:2010 Issue: Volume: Page:23-33
ISSN:0884-8289
Container-title:A Long View of Research and Practice in Operations Research and Management Science
language:
Short-container-title:

Author:

Birge John R.

Publisher

Springer US

Link

http://link.springer.com/content/pdf/10.1007/978-1-4419-6810-4_3.pdf

Reference30 articles.

1. Abhishek K, Leyffer S, Linderoth JT (2008) FilMINT: An outer-approximation-based solver for nonlinear mixed integer programs. Argonne National Laboratory, Mathematics and Computer Science Division Preprint ANL/MCS-P1374-0906, March 28

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

3. Barnhart C, Johnson EL, Nemhauser GL, Savelsbergh MWP, Vance PH (1998) Branch and price: Column generation for solving huge integer programs. Operations Research 46:316–329

4. Bellman R (1957) Dynamic programming. Princeton University Press, Princeton, NJ

5. Benders JF (1962) Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik 4:238–252

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

1. The Work-Averse Cyber Attacker Model: Theory and Evidence From Two Million Attack Signatures;SSRN Electronic Journal;2017

2. Introduction: A Long View of Research and Practice in Operations Research and Management Science;A Long View of Research and Practice in Operations Research and Management Science;2010