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

Structural aspects in the theory of probability

The e-book is conceived as a textual content accompanying the conventional graduate classes on chance concept. a major characteristic of this enlarged model is the emphasis on algebraic-topological features resulting in a much wider and deeper realizing of easy theorems equivalent to these at the constitution of constant convolution semigroups and the corresponding strategies with autonomous increments.

Stochastic Variational Approach to QM Few-Body Problems

The quantum-mechanical few-body challenge is of basic significance for all branches of microphysics and it has considerably broadened with the arrival of contemporary desktops. This publication offers an easy, unified recipe to acquire designated recommendations to almost any few-body bound-state challenge and offers its program to numerous difficulties in atomic, molecular, nuclear, subnuclear and sturdy kingdom physics.

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

Example text

A branch-and-price algorithm for multi-stage stochastic integer programming with application to stochastic batch-sizing problems. 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.

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.

A simple forward algorithm to solve general dynamic lot sizing models with n periods in O(n log n) or O(n) time. Management Science 37, 909–925 (1991) 11. : 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.

Download PDF sample

Rated 4.74 of 5 – based on 8 votes