An advanced implementation of the Dantzig—Wolfe decomposition algorithm for linear programming
- 1 December 1981
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 20 (1) , 303-326
- https://doi.org/10.1007/bf01589355
Abstract
No abstract availableKeywords
All Related Versions
This publication has 13 references indexed in Scilit:
- A Comparative Study of Two Methods for Staircase Linear ProgramsACM Transactions on Mathematical Software, 1980
- The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational resultsMathematical Programming, 1977
- Pivot selection methods of the Devex LP codePublished by Springer Nature ,1975
- Updated triangular factors of the basis to maintain sparsity in the product form simplex methodMathematical Programming, 1972
- The Partitioned Preassigned Pivot Procedure (P4)Published by Springer Nature ,1972
- Some Basic Techniques for Solving Sparse Systems of Linear EquationsPublished by Springer Nature ,1972
- Aspects of large-scale in-core linear programmingPublished by Association for Computing Machinery (ACM) ,1971
- Experiences in Using a Decomposition ProgramThe Computer Journal, 1965
- The Decomposition Algorithm for Linear ProgramsEconometrica, 1961
- Decomposition Principle for Linear ProgramsOperations Research, 1960