Service failure prediction in supply-chain networks
暂无分享,去创建一个
Brigitte Jaumard | Tristan Glatard | Mariam Tagmouti | Monika Sharma | Éric Gélinas | B. Jaumard | Éric Gélinas | Mariam Tagmouti | T. Glatard | Monika Sharma
[1] Ramakrishnan Srikant,et al. Fast algorithms for mining association rules , 1998, VLDB 1998.
[2] J. Holmström,et al. Solving the last mile issue: reception box or delivery box? , 2001 .
[3] Jian Pei,et al. Mining frequent patterns without candidate generation , 2000, SIGMOD '00.
[4] J. Wesley Barnes,et al. Solving the Pickup and Delivery Problem with Time Windows Using Reactive Tabu Search Transportation , 2000 .
[5] Jean-Michel Poggi,et al. Variable selection using random forests , 2010, Pattern Recognit. Lett..
[6] Leo Breiman,et al. Random Forests , 2001, Machine Learning.
[7] Nitesh V. Chawla,et al. SMOTE: Synthetic Minority Over-sampling Technique , 2002, J. Artif. Intell. Res..
[8] Tom Cherrett,et al. Addressing the Last Mile Problem , 2009 .
[9] David Pisinger,et al. An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows , 2006, Transp. Sci..
[10] Jean-François Cordeau,et al. Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows , 2009, Transp. Sci..