Early View Articles

Research Articles

Decomposable robust two‐stage optimization: An application to gas network operations under uncertainty

  • Author: Denis Aßmann, Frauke Liers, Michael Stingl
  • Pub Online: Jan 17, 2019
  • DOI: 10.1002/net.21871 (p )

The Firefighter problem: Saving sets of vertices on cubic graphs

  • Author: Christopher Duffy, Gary MacGillivray
  • Pub Online: Feb 16, 2019
  • DOI: 10.1002/net.21873 (p )

Special Issue Articles

An empirical validation and data‐driven extension of continuum approximation approaches for urban route distances

  • Author: Daniel Merchán, Matthias Winkenbach
  • Pub Online: Feb 18, 2019
  • DOI: 10.1002/net.21874 (p )

Impact of congestion pricing schemes on costs and emissions of commercial fleets in urban areas

  • Author: Shu Zhang, Ann M. Campbell, Jan F. Ehmke
  • Pub Online: Feb 18, 2019
  • DOI: 10.1002/net.21872 (p )

Leveraging single‐objective heuristics to solve bi‐objective problems: Heuristic box splitting and its application to vehicle routing

  • Author: Piotr Matl, Richard F. Hartl, Thibaut Vidal
  • Pub Online: Feb 18, 2019
  • DOI: 10.1002/net.21876 (p )

Research Articles

Evasive flow capture: Optimal location of weigh‐in‐motion systems, tollbooths, and security checkpoints

  • Author: Nikola Marković, Paul Schonfeld, Ilya O. Ryzhov
  • Pub Online: Nov 27, 2014
  • DOI: 10.1002/net.21581 (p )

A branch‐and‐price algorithm for the ( k,c )‐coloring problem

  • Author: Enrico Malaguti, Isabel Méndez‐Díaz, Juan José Miranda‐Bront, Paula Zabala
  • Pub Online: Nov 27, 2014
  • DOI: 10.1002/net.21579 (p )

Special Issue

Sorting common operations to minimize the number of tardy jobs

  • Author: Claudio Arbib, Mara Servilio, Giovanni Felici, Mara Servilio
  • Pub Online: Nov 27, 2014
  • DOI: 10.1002/net.21576 (p )

Special Issue Article

The relocation problem for the one‐way electric vehicle sharing

  • Author: Maurizio Bruglieri, Alberto Colorni, Alessandro Luè
  • Pub Online: Nov 27, 2014
  • DOI: 10.1002/net.21585 (p )

Research Articles

More facets for survivable networks

  • Author: Gabriella Muratore
  • Pub Online: Nov 28, 2014
  • DOI: 10.1002/net.21573 (p )

A branch‐and‐cut algorithm for the multi‐vehicle traveling purchaser problem with pairwise incompatibility constraints

  • Author: Daniele Manerba, Renata Mansini
  • Pub Online: Dec 03, 2014
  • DOI: 10.1002/net.21588 (p )

Bounds on the fault‐diameter of graphs

  • Author: Peter Dankelmann
  • Pub Online: Jul 25, 2017
  • DOI: 10.1002/net.21758 (p )


Preface: Recent advances in telecommunications networks planning and operation

  • Author: Bernard Fortz, Dimitri Papadimitriou, Mauricio G. C. Resende
  • Pub Online: Nov 15, 2017
  • DOI: 10.1002/net.21795 (p )

Special Issue Articles

The capacity formulation of the capacitated edge activation problem

  • Author: Sara Mattia
  • Pub Online: Nov 22, 2017
  • DOI: 10.1002/net.21797 (p )

Open shortest path first routing under random early detection

  • Author: Jiaxin Liu, Stanko Dimitrov
  • Pub Online: Nov 21, 2017
  • DOI: 10.1002/net.21792 (p )
Page:   1 2 3 Next

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.