Piecewise Linear Valued CSPs Solvable by Linear Programming Relaxation.
Manuel BodirskyMarcello MaminoCaterina ViolaPublished in: ACM Trans. Comput. Log. (2022)
Keyphrases
- piecewise linear
- linear programming relaxation
- constraint satisfaction problems
- np hard
- knapsack problem
- lower bound
- np complete
- linear programming
- integer programming
- dynamic programming
- binary variables
- constraint satisfaction
- special case
- branch and bound
- constraint propagation
- column generation
- feasible solution
- integer solution
- valid inequalities
- arc consistency
- optimal solution
- mixed integer programming
- search space
- computational complexity
- constraint programming
- upper bound
- objective function
- cutting plane
- scheduling problem
- hyperplane
- integer program
- production planning
- network flow
- cost function
- optimization problems
- branch and bound algorithm
- mathematical model