Francisco Barahona
Mathematical Programming
We present an integer programming model for plant location with inventory costs. The linear programming relaxation has been solved by Dantzig-Wolfe decomposition. In this case the subproblems reduce to the minimum cut problem. We have used subgradient optimization to accelerate the convergence of the D-W algorithm. We present our experience with problems arising in the design of a distribution network for computer spare parts. In most cases, from a fractional solution we were able to derive integer solutions within 4% of optimality. © 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.
Francisco Barahona
Mathematical Programming
Mourad Baiou, Francisco Barahona
Discrete Mathematics
Mourad Baïou, Francisco Barahona
Discrete Applied Mathematics
Alan E. Rosenbluth, David O. Melville, et al.
SPIE Advanced Lithography 2009