Adding cardinality constraints to integer programs with applications to maximum satisfiability.
Markus BläserThomas HeynenBodo MantheyPublished in: Inf. Process. Lett. (2008)
Keyphrases
- cardinality constraints
- integer program
- maximum satisfiability
- lp relaxation
- column generation
- boolean satisfiability
- linear program
- max sat
- integer programming
- cutting plane
- functional dependencies
- combinatorial problems
- sat problem
- branch and bound algorithm
- entity relationship
- network flow
- linear programming
- branch and bound
- sat solvers
- closed sets
- valid inequalities
- probabilistic planning
- constraint programming
- genetic algorithm
- database schema
- upper bound
- optimal solution
- domain specific
- np hard