Networks
Copyright © 2013 Wiley Periodicals, Inc., A Wiley Company

Edited By: Dr. B. L. Golden and Dr. D. R. Shier
Impact Factor: 0.983
ISI Journal Citation Reports © Ranking: 2011: 22/50 (Computer Science Hardware & Architecture); 34/77 (Operations Research & Management Science)
Online ISSN: 1097-0037
Recently Published Issues
Current Issue:May 2013
Volume 61, Issue 3
Volume 61, Issue 2
Special Issue: INOC 2011 Conference, June 13–16, 2...
Volume 61, Issue 1
Volume 60, Issue 4
Volume 60, Issue 3
Glover-Klingman Prize 2011 Winning Paper - enjoy with FREE access:
We are pleased to announce the winner of 2011 Glover-Klingman Prize!
View the winning paper with FREE access:
Periodic railway timetabling with event flexibility, Vol 57:1
Gabrio Caimi, Martin Fuchsberger, Marco Laumanns, Kaspar Schüpbach
Special Issues 2012
1097-0037/asset/homepages/Free_to_Download_button.jpg?v=1&s=53df28ea694c50d17f4e2aef641362f71fa884ff)
View these Networks Special Issues published to date in 2012:
In Honor of Rossella Petreschi,Vol 59:3
Special Issue on the INOC 2009 Conference, April 26–29, 2009, Pisa, Italy,Vol 59:2
Networks Call for Papers: Special Issue on Robust network Optimization
Networks Call for Papers: Special Issue on Robust network Optimization
We would like to receive original, high-quality research papers that address Robust Network Optimization. We are especially interested in submissions contributing to the following areas:
- Robust routing under uncertainty
- Resource assignment under uncertainty (dimensioning, provisioning, wavelength assignment, etc.)
- Survivability under uncertainty
- Network location under uncertainty
- Exact and approximation algorithms for robust network optimization problems
For full details on this upcoming Special Issue click here.
![]() |
Free Virtual Issue - Game-Theoretic Analysis of Networks
Access the new Free Virtual Issue from Networks!
This virtual issue contains papers that deal with such bilevel/Stackelberg games on networks, as well as those investigating cooperative network games and their associated cost allocation problems. Several papers deal with complexity and approximation results, in particular for welfare maximization in network congestion games.
Read all articles contained in this virtual issue for free...
Networks Free Sample Issue 2013
Enjoy the 2013 Sample Issue of Networks with FREE ACCESS today!

1097-0037/asset/NET_centre.gif?v=1&s=3b4a007baeb0bb143afbd4cdc905958e631876aa)
1097-0037/asset/homepages/Networks.jpg?v=1&s=9ed352df26fd03dd6096175ccf920b1ee130f334)
1097-0037/asset/homepages/41104_NET_VI_WEBREADY.jpg?v=1&s=ebfb64422c08e7368e24f4910c43e939812a3001)
1097-0037/asset/homepages/Free_Sample_Issue.jpg?v=1&s=cfe163c3d941a1679c482f0b736200f9bd38137b)