Dinkelbach's algorithm as an efficient method to solve a class of MINLP models for large-scale cyclic scheduling problems.
Fengqi YouPedro M. CastroIgnacio E. GrossmannPublished in: Comput. Chem. Eng. (2009)
Keyphrases
- probabilistic model
- dynamic programming
- computational complexity
- objective function
- cost function
- mixed integer nonlinear programming
- scheduling problem
- combinatorial optimization
- expectation maximization
- np hard
- em algorithm
- decomposition algorithm
- mathematical model
- worst case
- convergence rate
- bayesian framework
- parameter estimation
- graphical models
- upper bound
- optimal solution
- learning algorithm
- genetic algorithm
- convex hull
- lower bound