Recent advances in the decomposition approach to linear programming-Reference-Cited by-同舟云学术

Recent advances in the decomposition approach to linear programming

Published:1987 Issue: Volume: Page:119-128
ISSN:0303-3929
Container-title:Mathematical Programming Studies
language:
Short-container-title:

Author:

Ho James K.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0121182.pdf

Reference22 articles.

1. J. Abadie and A.C. Williams, “Dual and parametric methods in decomposition,” in: R.L. Graves and P. Wolfe, eds., Recent advances in mathematical programming (McGraw-Hill, New York 1963) pp. 149–158.

2. P. Abrahamson, “A nested decomposition approach for solving staircase linear programs,” in: G.B. Dantzig et al, eds, Large-scale linear programming, Vol. 1 (IIASA, Laxenburg, 1981) pp. 367–382.

3. D.C. Ament, J.K. Ho, E. Loute and M. Remmelswaal, “LIFT: a nested decomposition algorithm for solving lower block-triangular programs,” in: G.B. Dantzig et al, eds., Large-scale linear programming (IIASA, Laxenburg, 1981) pp. 383–408.

4. E.M.L. Beale, Private communications.

5. J.F. Benders, “Partitioning procedures for solving mixed-variables programming problems,” Numerische Mathematik 4 (1962) 238–252.

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

1. Algorithm 928;ACM Transactions on Mathematical Software;2013-04

2. Large-Scale Systems;Encyclopedia of Operations Research and Management Science;2013

3. Converging upon basic feasible solutions through Dantzig–Wolfe decomposition;Optimization Letters;2012-09-13

4. Dantzig-Wolfe Decomposition;Wiley Encyclopedia of Operations Research and Management Science;2011-02-15

5. A Unifying Polyhedral Approximation Framework for Convex Optimization;SIAM Journal on Optimization;2011-01