An enhanced L-Shaped method for optimizing periodic-review inventory control problems modeled via two-stage stochastic programming
暂无分享,去创建一个
[1] Alysson M. Costa. A survey on benders decomposition applied to fixed-charge network design problems , 2005, Comput. Oper. Res..
[2] B. Eddy Patuwo,et al. A dynamic two-segment partial backorder control of (r, Q) inventory system , 2001, Comput. Oper. Res..
[3] S. M. Moattar Husseini,et al. Investigating replenishment policies for centralised and decentralised supply chains using stochastic programming approach , 2015 .
[4] Fabricio Oliveira,et al. A two-stage stochastic programming model for periodic replenishment control system under demand uncertainty , 2017, Comput. Ind. Eng..
[5] Cheng-Chew Lim,et al. Optimal production and procurement decisions in a supply chain with an option contract and partial backordering under uncertainties , 2014, Appl. Math. Comput..
[6] Achim Koberstein,et al. Dynamic sequencing and cut consolidation for the parallel hybrid-cut nested L-shaped method , 2013, Eur. J. Oper. Res..
[7] Ignacio E. Grossmann,et al. Accelerating Benders stochastic decomposition for the optimization under uncertainty of the petroleum product supply chain , 2014, Comput. Oper. Res..
[8] David W. Pentico,et al. The deterministic EOQ with partial backordering: A new approach , 2009, Eur. J. Oper. Res..
[9] Stephen J. Wright,et al. Decomposition Algorithms for Stochastic Programming on a Computational Grid , 2001, Comput. Optim. Appl..
[10] B. Abbasi,et al. A two-stage stochastic programming model for inventory management in the blood supply chain , 2017 .
[11] R. Wets,et al. L-SHAPED LINEAR PROGRAMS WITH APPLICATIONS TO OPTIMAL CONTROL AND STOCHASTIC PROGRAMMING. , 1969 .
[12] Golbon Zakeri,et al. Inexact Cuts in Benders Decomposition , 1999, SIAM J. Optim..
[13] Jean-François Cordeau,et al. A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem , 2003, Comput. Oper. Res..
[14] K. Moinzadeh. Operating characteristics of the ( S -1, S ) inventory system with partial backorders and constant resupply times , 1989 .
[15] Lixin Miao,et al. A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem , 2014, Eur. J. Oper. Res..
[16] Hanif D. Sherali,et al. On generating maximal nondominated Benders cuts , 2013, Ann. Oper. Res..
[17] Deepak Ponvel Chermakani. Optimal Aggregation of Blocks into Subproblems in Linear-Programs with Block-Diagonal-Structure , 2015, ArXiv.
[18] Michel Gendreau,et al. Accelerating Benders decomposition for closed-loop supply chain network design: Case of used durable products with different quality levels , 2016, Eur. J. Oper. Res..
[19] J. Birge,et al. A multicut algorithm for two-stage stochastic linear programs , 1988 .
[20] M. Laughton,et al. Large-scale mixed integer programming: Benders-type heuristics , 1984 .
[21] Samir Elhedhli,et al. An interior-point Benders based branch-and-cut algorithm for mixed integer programs , 2010, Annals of Operations Research.
[22] B. Eddy Patuwo,et al. A partial backorder control for continuous review (r, Q) inventory system with poisson demand and constant lead time , 1995, Comput. Oper. Res..
[23] Silvio Hamacher,et al. Stochastic Benders decomposition for the supply chain investment planning problem under demand uncertainty , 2012 .
[24] Kal Namit,et al. Solutions to the inventory model for gamma lead‐time demand , 1999 .
[25] J. Sicilia,et al. Analysis of an EOQ inventory model with partial backordering and non-linear unit holding cost , 2015 .
[26] Teodor Gabriel Crainic,et al. Partial Decomposition Strategies for Two-Stage Stochastic Integer Programs , 2014 .
[27] Georgios K. D. Saharidis,et al. Initialization of the Benders master problem using valid inequalities applied to fixed-charge network problems , 2011, Expert Syst. Appl..
[28] Paul H. Zipkin,et al. Foundations of Inventory Management , 2000 .
[29] Michel Gendreau,et al. Accelerating Benders Decomposition by Local Branching , 2009, INFORMS J. Comput..
[30] John M. Wilson,et al. Introduction to Stochastic Programming , 1998, J. Oper. Res. Soc..
[31] Chandrasekhar Das. The (S - 1, S) Inventory Model under Time Limit on Backorders , 1977, Oper. Res..
[32] Nikolaos Papadakos,et al. Practical enhancements to the Magnanti-Wong method , 2008, Oper. Res. Lett..
[33] Thierry Benoist,et al. Constraint Programming Contribution to Benders Decomposition: A Case Study , 2002, CP.
[34] Arthur F. Veinott,et al. Analysis of Inventory Systems , 1963 .
[35] Paolo Toth,et al. On exact solutions for the Minmax Regret Spanning Tree problem , 2014, Comput. Oper. Res..
[36] A. Thangam,et al. A two-level supply chain with partial backordering and approximated Poisson demand , 2008, Eur. J. Oper. Res..
[37] Jong Min Lee,et al. A tighter cut generation strategy for acceleration of Benders decomposition , 2012, Comput. Chem. Eng..
[38] Thomas L. Magnanti,et al. Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria , 1981, Oper. Res..
[39] Mir Saman Pishvaee,et al. An accelerated Benders decomposition algorithm for sustainable supply chain network design under uncertainty: A case study of medical needle and syringe supply chain , 2014 .
[40] André Langevin,et al. Scheduling and routing of automated guided vehicles: A hybrid approach , 2007, Comput. Oper. Res..
[41] M. Matos,et al. Distribution Systems Reconfiguration Based on OPF Using Benders Decomposition , 2009, IEEE Transactions on Power Delivery.
[42] Marianthi G. Ierapetritou,et al. Accelerating Benders method using covering cut bundle generation , 2010, Int. Trans. Oper. Res..
[43] Ford W. Harris,et al. How Many Parts to Make at Once , 1990, Oper. Res..
[44] Jacques F. Benders,et al. Partitioning procedures for solving mixed-variables programming problems , 2005, Comput. Manag. Sci..
[45] Nicolas Barnier,et al. Solving the Kirkman's schoolgirl problem in a few seconds , 2002 .
[46] Maria Grazia Scutellà,et al. A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks , 2016, Eur. J. Oper. Res..
[47] Wei Jiang,et al. An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions , 2013, Ann. Oper. Res..
[48] Xu Andy Sun,et al. Adaptive Robust Optimization for the Security Constrained Unit Commitment Problem , 2013, IEEE Transactions on Power Systems.
[49] Jean-François Cordeau,et al. Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling , 2000, Transp. Sci..
[50] M. J. M. Posner,et al. A class of inventory models with customer impatience , 1972 .