By Guan Y., Ahmed Sh.
Read or Download A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem PDF
Best probability books
Facing Uncertainties is an cutting edge monograph that lays targeted emphasis at the deductive method of uncertainties and at the form of uncertainty distributions. this attitude has the potential of facing the uncertainty of a unmarried info aspect and with units of knowledge that experience diversified weights.
Inefficient, overstaffed and detached to the public's wishes, the Soviet fiscal forms operates this present day a lot because it did within the Thirties. In Restructuring the Soviet monetary forms, Paul R. Gregory takes an within examine how the program works and why it has characteristically been so proof against swap.
Additional info for A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
A polyhedral study for stochastic lot-sizing problems. D. dissertation, Georgia Institute of Technology. Pairing inequalities and stochastic lot-sizing. A study in integer programming 12. : Formulations and two-period study for the stochastic uncapacitated lot-sizing problem. On formulations of the stochastic uncapacitated lot-sizing problem. Submitted for publication, 2005 13. : Progressive hedging as a meta-heuristic applied to stochastic lot-sizing. European Journal of Operations Research 132, 103–109 (2001) 14.
Working paper, Department of Systems and Industrial Engineering, University of Arizona, Tucson, AZ, 2003 17. : Polyhedral Approaches to Capacitated Lot-Sizing Problems. D. dissertation, Georgia Institute of Technology, 1999 18. : Integer and Combinatorial Optimization. John Wiley & Sons, 1988 19. : Valid inequalities and separation for capacitated economic lot sizing. Oper. Res. Lett. 7, 109–115 (1988) 20. : Lot-sizing with constant batches: Formulation and valid inequalities. Mathe. Oper. Res.
Res. 18, 767–785 (1993) 21. , Shapiro, A. (eds): Stochastic Programming. Handbooks in Operations Research and Management Science 10. Elsevier, 2003. 22. : Polyhedral characterization of the economic lot-sizing problem with start-up costs. SIAM J. Discrete Math. 7, 141–151 (1994) 23. : Economic lot sizing: An O(n log n) algorithm that runs in linear time in the Wagner-Whitin case. Oper. Res. 40, 145–156 (1992) 24. : Dynamic version of the economic lot size model.
A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem by Guan Y., Ahmed Sh.