The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3
Published Online:1 Aug 2006https://doi.org/10.1287/ijoc.1040.0117
Supplemental Material
ijoc.1040.0117-sm-irnich.pdf (619 KB)
Use this option if you have an account on informs.org or if you want to become an INFORMS member
Member LoginApril 12, 2013 - June 15, 2026
April 12, 2013 - June 15, 2026
Stefan Irnich
[email protected]RWTH Aachen University, Deutsche Post Lehrstuhl für Optimierung von Distributionsnetzwerken, Templergraben 64, 52062 Aachen, Germany
Daniel Villeneuve
[email protected]Kronos Altitude Division, 3535 Queen Mary, Suite 650, Montréal, Québec, Canada H3V 1H8
Stefan Irnich
[email protected]RWTH Aachen University, Deutsche Post Lehrstuhl für Optimierung von Distributionsnetzwerken, Templergraben 64, 52062 Aachen, Germany
Daniel Villeneuve
[email protected]Kronos Altitude Division, 3535 Queen Mary, Suite 650, Montréal, Québec, Canada H3V 1H8
ijoc.1040.0117-sm-irnich.pdf (619 KB)

Copyright © 2006, INFORMS
