Table of Contents

Volume 42 Issue 1 (August 2003)


Algorithms for source‐to‐all maximum cost‐to‐time ratio problem in acyclic networks

  • Author: Alexandra Makri, Diego Klabjan
  • Pub Online: May 21, 2003
  • DOI: 10.1002/net.10070 (p 1-14)

The spectra of wrapped butterfly digraphs

  • Author: Francesc Comellas, Miquel Angel Fiol, Joan Gimbert, Margarida Mitjana
  • Pub Online: May 21, 2003
  • DOI: 10.1002/net.10085 (p 15-19)

A general construction for nonblocking crosstalk‐free photonic switching networks

  • Author: Frank K. Hwang, Wen‐Dar Lin
  • Pub Online: Jun 03, 2003
  • DOI: 10.1002/net.10078 (p 20-25)

An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections

  • Author: R. Baldacci, E. Hadjiconstantinou, A. Mingozzi
  • Pub Online: Jun 03, 2003
  • DOI: 10.1002/net.10079 (p 26-41)

The facility location problem with general cost functions

  • Author: M. T. Hajiaghayi, M. Mahdian, V. S. Mirrokni
  • Pub Online: Jun 03, 2003
  • DOI: 10.1002/net.10080 (p 42-47)

Solving the p ‐Center problem with Tabu Search and Variable Neighborhood Search

  • Author: Nenad Mladenović, Martine Labbé, Pierre Hansen
  • Pub Online: Jul 08, 2003
  • DOI: 10.1002/net.10081 (p 48-64)

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.