Incorporating bounds from decision diagrams into integer programming.
Christian TjandraatmadjaWillem-Jan van HoevePublished in: Math. Program. Comput. (2021)
Keyphrases
- integer programming
- decision diagrams
- np hard
- multi valued
- lower bound
- upper bound
- linear programming
- constraint programming
- cutting plane
- lagrangian relaxation
- markov decision processes
- constraint satisfaction problems
- column generation
- digital circuits
- efficient computation
- valid inequalities
- integer program
- np complete
- binary decision diagrams
- worst case
- data compression
- learning algorithm
- lower and upper bounds
- compressed data
- planning problems
- computational efficiency
- cutting plane algorithm
- set partitioning