Piecewise Linear Valued CSPs Solvable by Linear Programming Relaxation.
Manuel BodirskyMarcello MaminoCaterina ViolaPublished in: CoRR (2019)
Keyphrases
- piecewise linear
- linear programming relaxation
- constraint satisfaction problems
- np hard
- knapsack problem
- np complete
- linear programming
- lower bound
- integer programming
- dynamic programming
- binary variables
- branch and bound
- constraint satisfaction
- column generation
- special case
- integer solution
- constraint propagation
- search space
- mixed integer programming
- arc consistency
- feasible solution
- constraint programming
- optimal solution
- integer program
- valid inequalities
- hyperplane
- computational complexity
- upper bound
- scheduling problem
- mixed integer
- cutting plane
- branch and bound algorithm
- production planning
- lagrangian relaxation
- linear program
- worst case
- combinatorial optimization
- high dimensional