Subject
Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering
Reference30 articles.
1. Akartunalı, K., Doostmohammadi, M., & Fragkos, I. (2017). A branch-and-cut algorithm using two-period relaxations for big-bucket lot-sizing problems with non-zero setup times. Working paper, University of Strathclyde Business School.
2. Local cuts and two-period convex hull closures for big-bucket lot-sizing problems;Akartunalı;INFORMS Journal on Computing,2016
3. A computational analysis of lower bounds for big bucket production planning problems;Akartunalı;Computational Optimization and Applications,2012
4. Period decompositions for the capacitated lot sizing problem with setup times;de Araujo;INFORMS Journal on Computing,2015
5. Strong formulations for multi-item capacitated lot-sizing;Barany;Management Science,1984
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献