Networks

Table of Contents

Volume 55 Issue 1 (January 2010)

1-59

Preface

Preface

  • Author: Dominique Feillet, Gilbert Laporte, Frédéric Semet
  • Pub Online: Jul 31, 2009
  • DOI: 10.1002/net.20308 (p 1-1)

Almost sure asymptotic optimality for online routing and machine scheduling problems

  • Author: Patrick Jaillet, Michael R. Wagner
  • Pub Online: Mar 06, 2009
  • DOI: 10.1002/net.20309 (p 2-12)

A branch‐and‐cut algorithm for the k ‐edge connected subgraph problem

  • Author: F. Bendali, I. Diarrassouba, A.R. Mahjoub, M. Didi Biha, J. Mailfert
  • Pub Online: Mar 06, 2009
  • DOI: 10.1002/net.20310 (p 13-32)

k ‐Splittable delay constrained routing problem: A branch‐and‐price approach

  • Author: Jérôme Truffot, Christophe Duhamel, Philippe Mahey
  • Pub Online: May 06, 2009
  • DOI: 10.1002/net.20311 (p 33-45)

A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading

  • Author: Jean‐François Cordeau, Manuel Iori, Gilbert Laporte, Juan José Salazar González
  • Pub Online: May 06, 2009
  • DOI: 10.1002/net.20312 (p 46-59)

Related Topics

Related Publications

Related Content

Site Footer

Address:

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 StatisticsViews.com are checked for statistical accuracy by a panel from the European Network for Business and Industrial Statistics (ENBIS)   to whom Wiley and StatisticsViews.com 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.