Strongly polynomial algorithms for the unsplittable problem (2001)

by Y Azar, O Regev
Venue:In Proceedings of the 8th Integer Programming and Combinatorial Optimization Conference (IPCO), LNCS 2081