Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints
暂无分享,去创建一个
[1] Adel Hatami-Marbini,et al. A taxonomy and review of the fuzzy data envelopment analysis literature: Two decades in the making , 2011, Eur. J. Oper. Res..
[2] Marcus Poggi de Aragão,et al. Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems , 2010, Math. Program. Comput..
[3] Mauro Dell'Amico,et al. Friendly bin packing instances without Integer Round-up Property , 2015, Math. Program..
[4] Martin W. P. Savelsbergh,et al. The Continuous-Time Service Network Design Problem , 2017, Oper. Res..
[5] Guy Desaulniers,et al. Multi-phase dynamic constraint aggregation for set partitioning type problems , 2010, Math. Program..
[6] François Clautiaux,et al. Theoretical Investigation of Aggregation in Pseudo-polynomial Network-Flow Models , 2012, ISCO.
[7] James R. Evans,et al. Aggregation and Disaggregation Techniques and Methodology in Optimization , 1991, Oper. Res..
[8] Giuseppe Lancia,et al. A time-indexed LP-based approach for min-sum job-shop problems , 2011, Ann. Oper. Res..
[9] Michel Gendreau,et al. An exact algorithm for a single-vehicle routing problem with time windows and multiple routes , 2007, Eur. J. Oper. Res..
[10] Cláudio Alves,et al. Arc-flow model for the two-dimensional guillotine cutting stock problem , 2010, Comput. Oper. Res..
[11] David S. Johnson,et al. `` Strong '' NP-Completeness Results: Motivation, Examples, and Implications , 1978, JACM.
[12] José M. Valério de Carvalho,et al. LP models for bin packing and cutting stock problems , 2002, Eur. J. Oper. Res..
[13] Guy Desaulniers,et al. Dynamic Aggregation of Set-Partitioning Constraints in Column Generation , 2003, Oper. Res..
[14] Giovanni Righini,et al. New dynamic programming algorithms for the resource constrained elementary shortest path problem , 2008 .
[15] Paolo Toth,et al. State-space relaxation procedures for the computation of bounds to routing problems , 1981, Networks.
[16] Manuel Iori,et al. Bin packing and cutting stock problems: Mathematical models and exact algorithms , 2016, Eur. J. Oper. Res..
[17] Andreas Bärmann,et al. Solving network design problems via iterative aggregation , 2015, Math. Program. Comput..
[18] Marius M. Solomon,et al. Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..
[19] Cláudio Alves,et al. Solving exactly the vehicle routing problem with time windows and multiple routes using a pseudo-polynomial model , 2011 .