Upper and lower bounds based on linear programming for the b-coloring problem.
Roberto MontemanniXiaochen ChouDerek H. SmithPublished in: EURO J. Comput. Optim. (2022)
Keyphrases
- upper and lower bounds
- linear programming
- upper bound
- lower bound
- linear program
- optimal solution
- lower and upper bounds
- quadratic programming
- feasible solution
- np hard
- dynamic programming
- sample complexity
- primal dual
- objective function
- marginal probabilities
- dnf formulas
- training data
- tight upper and lower bounds
- column generation
- integer programming
- linear programming relaxation
- feature space