Skip to content

Download A branch-and-cut algorithm for the stochastic uncapacitated by Guan Y., Ahmed Sh. PDF

By Guan Y., Ahmed Sh.

Show description

Read or Download A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem PDF

Best probability books

Brownian motion, obstacles, and random media

Offers an account of the non-specialist of the circle of principles, effects & options, which grew out within the research of Brownian movement & random hindrances. DLC: Brownian movement methods.

Ecole d'Ete de Probabilites de Saint-Flour XV-XVII, 1985. 87

This quantity comprises designated, worked-out notes of six major classes given on the Saint-Flour summer time colleges from 1985 to 1987.

Chance & choice: memorabilia

This ebook starts off with a old essay entitled "Will the solar upward thrust back? " and ends with a normal deal with entitled "Mathematics and Applications". The articles conceal an engaging variety of issues: combinatoric percentages, classical restrict theorems, Markov chains and approaches, capability concept, Brownian movement, Schrödinger–Feynman difficulties, and so forth.

Continuous-Time Markov Chains and Applications: A Two-Time-Scale Approach

This e-book offers a scientific therapy of singularly perturbed platforms that clearly come up on top of things and optimization, queueing networks, production structures, and fiscal engineering. It offers effects on asymptotic expansions of recommendations of Komogorov ahead and backward equations, homes of practical career measures, exponential top bounds, and sensible restrict effects for Markov chains with susceptible and robust interactions.

Additional info for A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem

Sample text

Lot-sizing with constant batches: Formulation and valid inequalities. Mathe. Oper. 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.

Lot-sizing with constant batches: Formulation and valid inequalities. Mathe. Oper. 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.

Mathe. Oper. 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.

Download PDF sample

Rated 4.53 of 5 – based on 12 votes