A comprehensive approach for managing feasible solutions in production planning by an interacting network of Zero-Suppressed Binary Decision Diagrams.
Keita TakahashiMasahiko OnosatoFumiki TanakaPublished in: J. Comput. Des. Eng. (2015)
Keyphrases
- binary decision diagrams
- production planning
- feasible solution
- linear programming
- integer programming
- boolean functions
- lagrangian relaxation
- optimal solution
- planning problems
- knapsack problem
- objective function
- lot sizing
- tabu search
- mixed integer programming
- mathematical model
- mixed integer
- convex hull
- model checking
- network design
- infinite horizon
- genetic algorithm
- domain independent
- multistage
- np complete
- particle swarm optimization
- dynamic programming
- lower bound