Login / Signup

N-period contracts with ordering constraints and total minimum commitments: Optimal and heuristic solutions.

Ronald S. Tibben-Lembke
Published in: Eur. J. Oper. Res. (2004)
Keyphrases
  • ordering constraints
  • minimum cost
  • graph cuts
  • graph cut segmentation
  • optimal solution
  • dynamic programming
  • htn planning
  • search algorithm
  • medical images
  • expected profit