Preprocessing techniques and column generation algorithms for stochastically efficient demand

DOI10.1057/PALGRAVE.JORS.2602475zbMATH Open1153.91627OpenAlexW1965088395MaRDI QIDQ3545661FDOQ3545661

Authors

Publication date 11 December 2008

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/palgrave.jors.2602475

zbMATH Keywords

stochastic programmingsupply chain managementcolumn generationpreprocessingstochastic efficiency

Mathematics Subject Classification ID

Consumer behavior, demand theory (91B42)

Recommendations

• An Efficient Trajectory Method for Probabilistic Production-Inventory-Distribution Problems
• Preprocessing in Stochastic Programming: The Case of Uncapacitated Networks
• A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands
• An efficient computational method for a stochastic dynamic lot-sizing problem under service-level constraints
• An extended mixed-integer programming formulation and dynamic cut generation approach for the stochastic lot-sizing problem

Cited in

(4)

• Chance constrained unit commitment approximation under stochastic wind energy
• Probabilistic modeling of multiperiod service levels
• Pattern definition of the \(p\)-efficiency concept
• Mathematical programming approaches for generating \(p\)-efficient points

This page was built for publication: Preprocessing techniques and column generation algorithms for stochastically efficient demand

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3545661)