Networks

Cover image for Vol. 58 Issue 2

September 2011

Volume 58, Issue 2

Pages 81–158

    1. Editorial: Preface to the Special Issue (pages 81–82)

      Bernard Fortz and Luce Brotcorne

      Version of Record online: 2 AUG 2011 | DOI: 10.1002/net.20449

    2. The preemptive swapping problem on a tree (pages 83–94)

      Shoshana Anily, Michel Gendreau and Gilbert Laporte

      Version of Record online: 2 AUG 2011 | DOI: 10.1002/net.20451

    3. Proximity and remoteness in graphs: Results and conjectures (pages 95–102)

      Mustapha Aouchiche and Pierre Hansen

      Version of Record online: 2 AUG 2011 | DOI: 10.1002/net.20450

    4. Scheduling two chains of unit jobs on one machine: A polyhedral study (pages 103–113)

      Claudio Arbib, Martine Labbé and Mara Servilio

      Version of Record online: 2 AUG 2011 | DOI: 10.1002/net.20452

    5. Progressive hedging-based metaheuristics for stochastic network design (pages 114–124)

      Teodor Gabriel Crainic, Xiaorui Fu, Michel Gendreau, Walter Rei and Stein W. Wallace

      Version of Record online: 2 AUG 2011 | DOI: 10.1002/net.20456

    6. Generalized network design polyhedra (pages 125–136)

      Corinne Feremans, Martine Labbé, Adam N. Letchford and Juan-José Salazar-González

      Version of Record online: 2 AUG 2011 | DOI: 10.1002/net.20455

    7. Minimax regret path location on trees (pages 147–158)

      Justo Puerto, Federica Ricca and Andrea Scozzari

      Version of Record online: 2 AUG 2011 | DOI: 10.1002/net.20453

SEARCH

SEARCH BY CITATION