Networks

Early View Articles

Research Articles

Stronger path‐based extended formulation for the Steiner tree problem

  • Author: Bartosz Filipecki, Mathieu Van Vyve
  • Pub Online: Jun 19, 2019
  • DOI: 10.1002/net.21901 (p )

Lexicographically optimal earliest arrival flows

  • Author: Naoyuki Kamiyama
  • Pub Online: Jun 26, 2019
  • DOI: 10.1002/net.21902 (p )

Parameterized algorithms and data reduction for the short secluded s‐t‐path problem

  • Author: Oxana Yu. Tsidulko, Till Fluschnik, René Bevern
  • Pub Online: Aug 28, 2019
  • DOI: 10.1002/net.21904 (p )

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 )

Editorial

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 )

Critical arcs detection in influence networks

  • Author: Colin P. Gillen, Alexander Veremyev, Oleg A. Prokopyev, Eduardo L. Pasiliao
  • Pub Online: Aug 24, 2017
  • DOI: 10.1002/net.21761 (p )

An adjustable sample average approximation algorithm for the stochastic production‐inventory‐routing problem

  • Author: Agostinho Agra, Cristina Requejo, Filipe Rodrigues
  • Pub Online: Nov 22, 2017
  • DOI: 10.1002/net.21796 (p )
Page:   1 2 3 Next

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.