minimum cost paths in a time-schedule network.

Yen-Liang Chen Dan Rinks Kwei Tang

Published in: J. Oper. Res. Soc. (2001)

Keyphrases

minimum cost
network flow
network flow problem
spanning tree
np hard
approximation algorithms
scheduling problem
minimum cost path
capacity constraints
network simplex algorithm
network design
complex networks
network structure
optimal path
path length
minimal cost
optimization model
minimum cost flow
shortest path