International Transactions in Operational Research

Cover image for International Transactions in Operational Research

November 2011

Volume 18, Issue 6

Pages 647–752

  1. Original Articles

    1. Top of page
    2. Original Articles
    3. Erratum
    1. Improving spectral bounds for clustering problems by Lagrangian relaxation (pages 647–661)

      Mohammad Dolatabadi, Andrea Lodi and Zahra Afsharnejad

      Version of Record online: 30 AUG 2011 | DOI: 10.1111/j.1475-3995.2011.00825.x

    2. A Tabu search algorithm for solving the extended maximal availability location problem (pages 663–678)

      Fernando Y. Chiyoshi and Reinaldo Morabito

      Version of Record online: 2 SEP 2011 | DOI: 10.1111/j.1475-3995.2011.00824.x

    3. A distributed and hierarchical strategy for autonomic grid-enabled cooperative metaheuristics with applications (pages 679–705)

      Aletéia P.F. Araújo, Cristina Boeres, Vinod E.F. Rebello and Celso C. Ribeiro

      Version of Record online: 2 SEP 2011 | DOI: 10.1111/j.1475-3995.2011.00823.x

    4. Solving a bus driver scheduling problem with randomized multistart heuristics (pages 707–727)

      Renato De Leone, Paola Festa and Emilia Marchitto

      Version of Record online: 13 SEP 2011 | DOI: 10.1111/j.1475-3995.2011.00827.x

    5. An enumeration algorithm for integer-valued data envelopment analysis (pages 729–740)

      Mohammad-Reza Alirezaee and Mohammad-Reza Rafiee Sani

      Version of Record online: 4 AUG 2011 | DOI: 10.1111/j.1475-3995.2011.00822.x

    6. An integer-valued data envelopment analysis model with bounded outputs (pages 741–749)

      Reza Kazemi Matin and Ali Emrouznejad

      Version of Record online: 6 SEP 2011 | DOI: 10.1111/j.1475-3995.2011.00828.x

  2. Erratum

    1. Top of page
    2. Original Articles
    3. Erratum
    1. You have free access to this content
      A note on “A branch-and-prune algorithm for the molecular distance geometry problem” (pages 751–752)

      Carlile Lavor, Leo Liberti and Nelson Maculan

      Version of Record online: 1 MAR 2011 | DOI: 10.1111/j.1475-3995.2011.00807.x

      This article corrects:

      A Branch-and-Prune algorithm for the Molecular Distance Geometry Problem

      Vol. 15, Issue 1, 1–17, Version of Record online: 2 JAN 2008