Francisco Barahona, Fabián A. Chudak
Discrete Optimization
We present an extension to the subgradient algorithm to produce primal as well as dual solutions. It can be seen as a fast way to carry out an approximation of Dantzig-Wolfe decomposition. This gives a fast method for producing approximations for large scale linear programs. It is based on a new theorem in linear programming duality. We present successful experience with linear programs coming from set partitioning, set covering, max-cut and plant location.
Francisco Barahona, Fabián A. Chudak
Discrete Optimization
Mourad Baïou, Francisco Barahona
Discrete Optimization
Radu Marinescu, Haifeng Qian, et al.
IJCAI 2023
Alan E. Rosenbluth, David O. Melville, et al.
SPIE Advanced Lithography 2009