Solving Project Scheduling Problems by Minimum Cut Computations.

Rolf H. Möhring Andreas S. Schulz Frederik Stork Marc Uetz

Published in: Manag. Sci. (2003)

Keyphrases

scheduling problem
minimum cut
maximum flow
graph cuts
shortest path problem
shortest path
combinatorial optimization
weighted graph
genetic algorithm
special case
np hard
convex optimization
graph partitioning
min cut