Networks

Table of Contents

Volume 44 Issue 2 (September 2004)

59-171

Foreword

Foreword

  • Author: Stefano Pallottino, Roberto Tadei
  • Pub Online: Jul 14, 2004
  • DOI: 10.1002/net.20016 (p 59-60)

A local branching heuristic for mixed‐integer programs with 2‐level variables, with an application to a telecommunication network design problem

  • Author: Matteo Fischetti, Carlo Polo, Massimo Scantamburlo
  • Pub Online: Jul 14, 2004
  • DOI: 10.1002/net.20017 (p 61-72)

On the impact of the solution representation for the Internet Protocol Network Design Problem with max‐hop constraints

  • Author: L. De Giovanni, F. Della Croce, R. Tadei
  • Pub Online: Jul 14, 2004
  • DOI: 10.1002/net.20018 (p 73-83)

Projecting the flow variables for hub location problems

  • Author: Martine Labbé, Hande Yaman
  • Pub Online: Jul 14, 2004
  • DOI: 10.1002/net.20019 (p 84-93)

Solving the Hub location problem in telecommunication network design: A local search approach

  • Author: G. Carello, F. Della Croce, M. Ghirardi, R. Tadei
  • Pub Online: Jul 14, 2004
  • DOI: 10.1002/net.20020 (p 94-105)

Grid scheduling by on‐line rectangle packing

  • Author: Massimiliano Caramia, Stefano Giordani, Antonio Iovanella
  • Pub Online: Jul 14, 2004
  • DOI: 10.1002/net.20021 (p 106-119)

Cardinality constrained path covering problems in grid graphs

  • Author: N. Apollonio, L. Caccetta, B. Simeone
  • Pub Online: Jul 27, 2004
  • DOI: 10.1002/net.20022 (p 120-131)

A competitive scheduling problem and its relevance to UMTS channel assignment

  • Author: Claudio Arbib, Stefano Smriglio, Mara Servilio
  • Pub Online: Jul 27, 2004
  • DOI: 10.1002/net.20023 (p 132-141)

Decomposition techniques for the minimum toll revenue problem

  • Author: Lihui Bai, Donald W. Hearn, Siriphong Lawphongpanich
  • Pub Online: Jul 27, 2004
  • DOI: 10.1002/net.20024 (p 142-150)

An implicit enumeration scheme for the batch selection problem

  • Author: A. Agnetis, F. Rossi, S. Smriglio
  • Pub Online: Jul 27, 2004
  • DOI: 10.1002/net.20025 (p 151-159)

A neighborhood search algorithm for the combined through and fleet assignment model with time windows

  • Author: Ravindra K. Ahuja, Jian Liu, James B. Orlin, Jon Goodstein, Amit Mukherjee
  • Pub Online: Jul 27, 2004
  • DOI: 10.1002/net.20026 (p 160-171)

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.