An efficient envelope-based Branch and Bound algorithm for non-convex combined heat and power production planning.
Aiying RongRisto LahdelmaPublished in: Eur. J. Oper. Res. (2007)
Keyphrases
- branch and bound algorithm
- production planning
- mixed integer linear programming
- lower bound
- np hard
- branch and bound
- integer programming
- knapsack problem
- optimal solution
- multi period
- upper bound
- lot sizing
- lower bounding
- infinite horizon
- precedence constraints
- lagrangian relaxation
- randomly generated problems
- upper bounding
- production cost
- convex optimization
- mixed integer programming
- combinatorial optimization
- planning horizon
- max sat
- column generation
- single machine scheduling problem
- cutting plane
- neural network
- setup cost
- linear programming relaxation
- finding an optimal solution
- convex hull
- linear program
- np complete
- simulated annealing
- search algorithm
- approximation algorithms
- metaheuristic
- constraint satisfaction problems
- linear programming
- scheduling problem
- genetic algorithm