1. A Lagrangian bound for many-to-many assignment problems

   • Igor Litvinchev
   • Socorro Rangel
   • Jania Saucedo

   OriginalPaper 02 December 2008 Pages: 241 - 257

2. The price of atomic selfish ring routing

   • Bo Chen
   • Xujin Chen
   • Xiaodong Hu

   OriginalPaper 16 June 2008 Pages: 258 - 278

3. Keeping partners together: algorithmic results for the hospitals/residents problem with couples

   • Eric J. McDermid
   • David F. Manlove

   OriginalPaper 27 August 2009 Pages: 279 - 303

4. Algorithms for storage allocation based on client preferences

   • Tami Tamir
   • Benny Vaksendiser

   OriginalPaper 27 August 2009 Pages: 304 - 324

5. Scheduling internal audit activities: a stochastic combinatorial optimization problem

   • Roberto Rossi
   • S. Armagan Tarim
   • Semra Karacaer

   OriginalPaper Open access 21 January 2009 Pages: 325 - 346

6. Just-in-time scheduling with controllable processing times on parallel machines

   • Yaron Leyvand
   • Dvir Shabtay
   • Liron Yedidsion

   OriginalPaper 14 November 2009 Pages: 347 - 368

7. A fast exact algorithm for the problem of optimum cooperation and the structure of its solutions

   • Diana Fanghänel
   • Frauke Liers

   OriginalPaper 17 January 2009 Pages: 369 - 393

8. An effective algorithm for obtaining the whole set of minimal cost pairs of disjoint paths with dual arc costs

   • T. Gomes
   • J. Craveirinha
   • L. Jorge

   OriginalPaper 21 August 2009 Pages: 394 - 414

9. Galaxy cutsets in graphs

   • Nicolas Sonnerat
   • Adrian Vetta

   OriginalPaper 27 August 2009 Pages: 415 - 427