Networks

Cover image for Vol. 59 Issue 4

July 2012

Volume 59, Issue 4

Pages 349–410

    1. Reload cost trees and network design (pages 365–379)

      Ioannis Gamvros, Luis Gouveia and S. Raghavan

      Article first published online: 1 AUG 2011 | DOI: 10.1002/net.20443

    2. Computing approximate Nash equilibria in network congestion games (pages 380–386)

      Andreas Emil Feldmann, Heiko Röglin and Berthold Vöcking

      Article first published online: 1 AUG 2011 | DOI: 10.1002/net.20444

    3. A branch-and-cut algorithm for the preemptive swapping problem (pages 387–399)

      Charles Bordenave, Michel Gendreau and G. Laporte

      Article first published online: 30 SEP 2011 | DOI: 10.1002/net.20447

    4. Coverings and matchings in r-partite hypergraphs (pages 400–410)

      Douglas S. Altner and J. Paul Brooks

      Article first published online: 27 MAR 2012 | DOI: 10.1002/net.20459

SEARCH

SEARCH BY CITATION