Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling.
Stefan IrnichGuy DesaulniersJacques DesrosiersAhmed HadjarPublished in: INFORMS J. Comput. (2010)
Keyphrases
- path selection
- shortest path
- multiple paths
- minimize total
- routing algorithm
- scheduling algorithm
- packet transmission
- strongly connected
- total cost
- scheduling problem
- routing decisions
- resource consumption
- round robin
- node selection
- flexible manufacturing systems
- link failure
- line segments
- ad hoc networks
- network topology
- wafer fabrication
- routing protocol
- material handling
- routing problem
- resource constraints
- resource allocation
- real time database systems
- network topologies
- expected cost
- mobile ad hoc networks