Shortest paths, single origin-destination network design, and associated polyhedra
Version of Record online: 11 OCT 2006
Copyright © 1993 Wiley Periodicals, Inc., A Wiley Company
Volume 23, Issue 2, pages 103–121, March 1993
How to Cite
Magnanti, T. L. and Mirchandani, P. (1993), Shortest paths, single origin-destination network design, and associated polyhedra. Networks, 23: 103–121. doi: 10.1002/net.3230230205
- Issue online: 11 OCT 2006
- Version of Record online: 11 OCT 2006
- Manuscript Accepted: JUL 1992
- Manuscript Received: MAY 1990
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)
- 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!