We propose a new decomposition method for large-scale linear programming. This method dualizes an (arbitrary) subset of the constraints and then maximizes the resulting dual functional by dual ascent.
The Journal of the Operational Research Society, Vol. 52, No. 5 (May, 2001), pp. 567-575 (9 pages) Several preprocessing rules to reduce integer programming problem size are proposed and examined for ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback