Networks

Cover image for Vol. 60 Issue 1

August 2012

Volume 60, Issue 1

Pages 1–69

    1. Models and heuristics for the k -degree constrained minimum spanning tree problem with node-degree costs (pages 1–18)

      Christophe Duhamel, Luís Gouveia, Pedro Moura and Maurício de Souza

      Version of Record online: 1 AUG 2011 | DOI: 10.1002/net.20445

    2. Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks (pages 19–30)

      Jean-François Côté, Michel Gendreau and Jean-Yves Potvin

      Version of Record online: 27 MAR 2012 | DOI: 10.1002/net.20448

    3. On stackelberg pricing with computationally bounded customers (pages 31–44)

      Patrick Briest, Luciano Gualà, Martin Hoefer and Carmine Ventre

      Version of Record online: 30 SEP 2011 | DOI: 10.1002/net.20457

    4. Completely independent spanning trees in torus networks (pages 59–69)

      Toru Hasunuma and Chie Morisaka

      Version of Record online: 16 SEP 2011 | DOI: 10.1002/net.20460

SEARCH

SEARCH BY CITATION