A Lagrangian bound for many-to-many assignment problems Igor LitvinchevSocorro RangelJania Saucedo OriginalPaper 02 December 2008 Pages: 241 - 257
The price of atomic selfish ring routing Bo ChenXujin ChenXiaodong Hu OriginalPaper 16 June 2008 Pages: 258 - 278
Keeping partners together: algorithmic results for the hospitals/residents problem with couples Eric J. McDermidDavid F. Manlove OriginalPaper 27 August 2009 Pages: 279 - 303
Algorithms for storage allocation based on client preferences Tami TamirBenny Vaksendiser OriginalPaper 27 August 2009 Pages: 304 - 324
Scheduling internal audit activities: a stochastic combinatorial optimization problem Roberto RossiS. Armagan TarimSemra Karacaer OriginalPaper Open access 21 January 2009 Pages: 325 - 346
Just-in-time scheduling with controllable processing times on parallel machines Yaron LeyvandDvir ShabtayLiron Yedidsion OriginalPaper 14 November 2009 Pages: 347 - 368
A fast exact algorithm for the problem of optimum cooperation and the structure of its solutions Diana FanghänelFrauke Liers OriginalPaper 17 January 2009 Pages: 369 - 393
An effective algorithm for obtaining the whole set of minimal cost pairs of disjoint paths with dual arc costs T. GomesJ. CraveirinhaL. Jorge OriginalPaper 21 August 2009 Pages: 394 - 414
