1. Semidefinite relaxations for partitioning, assignment and ordering problems

   • F. Rendl

   Invited Survey 11 August 2012 Pages: 321 - 346

2. Soft due window assignment and scheduling of unit-time jobs on parallel machines

   • Adam Janiak
   • Wladyslaw Janiak
   • Frank Werner

   Research Paper Open access 13 May 2012 Pages: 347 - 360

3. Minimizing the completion time of a project under resource constraints and feeding precedence relations: an exact algorithm

   • Lucio Bianco
   • Massimiliano Caramia

   Research Paper 17 May 2012 Pages: 361 - 377

4. On the calculation of stability radius for multi-objective combinatorial optimization problems by inverse optimization

   • Julien Roland
   • Yves De Smet
   • José Rui Figueira

   Research Paper 12 October 2012 Pages: 379 - 389

   

5. The two-echelon vehicle routing problem

   • Simona Mancini

   PhD Thesis 07 December 2011 Pages: 391 - 392

6. Heuristic algorithms and learning techniques: applications to the graph coloring problem

   • Daniel Cosmin Porumbel

   PhD Thesis 13 December 2011 Pages: 393 - 394

7. Models and methods for the constrained shortest path problem and its variants

   • Luigi Di Puglia Pugliese

   PhD Thesis 04 February 2012 Pages: 395 - 396

8. Shop and batch scheduling with constraints

   • Arnaud Malapert

   PhD Thesis 18 February 2012 Pages: 397 - 398

9. Acknowledgement to referees

   Acknowledgements 29 November 2012 Pages: 399 - 401