Author:
Furini Fabio,Shen Xueying
Publisher
Springer International Publishing
Reference13 articles.
1. M. Bartlett, A.M. Frisch, Y. Hamadi, I. Miguel, S.A. Tarim, C. Unsworth, The temporal knapsack problem and its solution, in Proceedings of the 2nd International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR 2005) (2005), pp. 34–48
2. P. Bonsma, J. Schulz, A. Wiese, A constant-factor approximation algorithm for unsplittable flow on paths. SIAM J. Comput. 43(2), 767–799 (2014)
3. A. Caprara, F. Furini, E. Malaguti, Uncommon Dantzig-Wolfe reformulation for the temporal knapsack problem. INFORMS J. Comput. 25(3), 560–571 (2013)
4. A. Ceselli, G. Righini, M. Salani, A column generation algorithm for a vehicle routing problem with economies of scale and additional constraints. Transp. Sci. 43(1), 56–69 (2009)
5. E.G. Coffman Jr., M.R. Garey, D.S. Johnson, Approximation algorithms for bin-packing—an updated survey, in Algorithm Design for Computer System Design (Springer, Vienna, 1984), pp. 49–106
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献