Networks

Cover image for Vol. 59 Issue 1

Special Issue: Special Issue on the INOC 2009 Conference, April 26–29, 2009, Pisa, Italy

January 2012

Volume 59, Issue 1

Pages 1–189

Issue edited by: Luis Gouveia, Maria Grazia Scutellà

    1. Editorial (pages 1–2)

      Luis Gouveia and Maria Grazia Scutellà

      Article first published online: 1 DEC 2011 | DOI: 10.1002/net.20474

    2. The complexity of the node capacitated in-tree packing problem (pages 13–21)

      Shinji Imahori, Yuichiro Miyamoto, Hideki Hashimoto, Yusuke Kobayashi, Mihiro Sasaki and Mutsunori Yagiura

      Article first published online: 19 NOV 2011 | DOI: 10.1002/net.20476

    3. You have free access to this content
      The load-distance balancing problem (pages 22–29)

      Edward Bortnikov, Samir Khuller, Jian Li, Yishay Mansour and Joseph Seffi Naor

      Article first published online: 19 NOV 2011 | DOI: 10.1002/net.20477

    4. On the minimum cut separator problem (pages 30–36)

      Walid Ben-Ameur and Mohamed Didi Biha

      Article first published online: 29 NOV 2011 | DOI: 10.1002/net.20478

    5. Survivability in hierarchical telecommunications networks (pages 37–58)

      Pierre Fouilhoux, Oya Ekin Karasan, A. Ridha Mahjoub, Onur Özkök and Hande Yaman

      Article first published online: 25 NOV 2011 | DOI: 10.1002/net.20479

    6. Network flow methods for electoral systems (pages 73–88)

      Friedrich Pukelsheim, Federica Ricca, Bruno Simeone, Andrea Scozzari and Paolo Serafini

      Article first published online: 25 NOV 2011 | DOI: 10.1002/net.20480

    7. Exact approaches to the single-source network loading problem (pages 89–106)

      Ivana Ljubić, Peter Putz and Juan-José Salazar-González

      Article first published online: 25 NOV 2011 | DOI: 10.1002/net.20481

    8. On a stochastic bilevel programming problem (pages 107–116)

      Stefanie Kosuch, Pierre Le Bodic, Janny Leung and Abdel Lisser

      Article first published online: 19 NOV 2011 | DOI: 10.1002/net.20482

    9. Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem (pages 148–160)

      Eduardo Uchoa, Túlio A. M. Toffolo, Mauricio C. de Souza, Alexandre X. Martins and Ricardo Fukasawa

      Article first published online: 29 NOV 2011 | DOI: 10.1002/net.20485

    10. Exactly solving a two-level location problem with modular node capacities (pages 161–180)

      Bernardetta Addis, Giuliana Carello and Alberto Ceselli

      Article first published online: 25 NOV 2011 | DOI: 10.1002/net.20486

SEARCH

SEARCH BY CITATION