Table of Contents

Volume 56 Issue 3 (October 2010)


Network flow spanners

  • Author: Feodor F. Dragan, Chenyu Yan
  • Pub Online: Oct 19, 2009
  • DOI: 10.1002/net.20357 (p 159-168)

A branch‐and‐cut‐and‐price algorithm for vertex‐biconnectivity augmentation

  • Author: Ivana Ljubić
  • Pub Online: Dec 18, 2009
  • DOI: 10.1002/net.20358 (p 169-182)

The degree‐preserving spanning tree problem in strongly chordal and directed path graphs

  • Author: Ching‐Chi Lin, Gerard J. Chang, Gen‐Huey Chen
  • Pub Online: Dec 18, 2009
  • DOI: 10.1002/net.20359 (p 183-187)

An ejection chain algorithm for the quadratic assignment problem

  • Author: Cesar Rego, Tabitha James, Fred Glover
  • Pub Online: Dec 03, 2009
  • DOI: 10.1002/net.20360 (p 188-206)

Mixed search number and linear‐width of interval and split graphs

  • Author: Fedor V. Fomin, Pinar Heggernes, Rodica Mihai
  • Pub Online: Dec 03, 2009
  • DOI: 10.1002/net.20373 (p 207-214)

A mean‐variance model for the minimum cost flow problem with stochastic arc costs

  • Author: Stephen D. Boyles, S. Travis Waller
  • Pub Online: Dec 03, 2009
  • DOI: 10.1002/net.20374 (p 215-227)

Related Topics

Related Publications

Related Content

Site Footer


This website is provided by John Wiley & Sons Limited, The Atrium, Southern Gate, Chichester, West Sussex PO19 8SQ (Company No: 00641132, VAT No: 376766987)

Published features on are checked for statistical accuracy by a panel from the European Network for Business and Industrial Statistics (ENBIS)   to whom Wiley and express their gratitude. This panel are: Ron Kenett, David Steinberg, Shirley Coleman, Irena Ograjenšek, Fabrizio Ruggeri, Rainer Göb, Philippe Castagliola, Xavier Tort-Martorell, Bart De Ketelaere, Antonio Pievatolo, Martina Vandebroek, Lance Mitchell, Gilbert Saporta, Helmut Waldl and Stelios Psarakis.