Lower and upper bounds on the switching activity in scheduled data flow graphs.

Lars Kruse Eike Schmidt Gerd Jochens Wolfgang Nebel

Published in: ISLPED (1999)

Keyphrases

lower and upper bounds
lower bound
upper bound
upper and lower bounds
lower bounding
lagrangian relaxation
scheduling problem
activity patterns
itemsets
valid inequalities
exact and approximate
human activities
branch and bound algorithm
cutting plane algorithm
lagrangian dual