Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty
Version of Record online: 26 APR 2012
Copyright © 2012 Wiley Periodicals, Inc.
Volume 60, Issue 2, pages 132–139, September 2012
How to Cite
Altin, A., Fortz, B. and Ümit, H. (2012), Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty. Networks, 60: 132–139. doi: 10.1002/net.21461
- Issue online: 1 AUG 2012
- Version of Record online: 26 APR 2012
- Manuscript Accepted: DEC 2011
- Manuscript Received: JUL 2009
- Walloon Region (DGTRE) (TOTEM Project)
- Communauté française de Belgique
- Actions de Recherche Concertées (ARC)
- FRFC (Groupe de Programmation Mathématique)
- FNRS (Bourse de Séjour Scientifique)
Options for accessing this content:
- If you are a society or association member and require assistance with obtaining online access instructions please contact our Journal Customer Services team.
- If your institution does not currently subscribe to this content, please recommend the title to your librarian.
- Login via other institutional login options http://onlinelibrary.wiley.com/login-options.
- You can purchase online access to this Article for a 24-hour period (price varies by title)
- If you already have a Wiley Online Library or Wiley InterScience user account: login above and proceed to purchase the article.
- New Users: Please register, then proceed to purchase the article.
Login via OpenAthens
Search for your institution's name below to login via Shibboleth.
Registered Users please login:
- Access your saved publications, articles and searches
- Manage your email alerts, orders and subscriptions
- Change your contact information, including your password
Please register to:
- Save publications, articles and searches
- Get email alerts
- Get all the benefits mentioned below!