Integer-Programming Bounds on Pebbling Numbers of Cartesian-Product Graphs.
Franklin KenterDaphne E. SkipperPublished in: COCOA (2018)
Keyphrases
- integer programming
- cartesian product
- np hard
- upper bound
- constraint programming
- lagrangian relaxation
- lower bound
- linear programming
- column generation
- ai planning
- cutting plane algorithm
- production planning
- clause learning
- cutting plane
- vehicle routing problem with time windows
- integer program
- lower and upper bounds
- set covering problem
- set covering
- valid inequalities
- constraint satisfaction problems
- search algorithm
- genetic algorithm
- set partitioning
- special case
- evolutionary algorithm
- bayesian networks