Generalized probabilistic satisfiability through integer programming.
Glauber De BonaFábio Gagliardi CozmanMarcelo FingerPublished in: J. Braz. Comput. Soc. (2015)
Keyphrases
- integer programming
- np hard
- linear programming
- facility location
- lagrangian relaxation
- ai planning
- set covering problem
- cutting plane
- np complete
- constraint programming
- satisfiability problem
- column generation
- production planning
- probabilistic model
- network flow
- inference problems
- set covering
- computational complexity
- cutting plane algorithm
- integer program
- valid inequalities
- bayesian networks
- global constraints
- vehicle routing problem with time windows
- set partitioning
- transportation problem
- linear programming relaxation
- phase transition
- linear program
- graphical models
- special case
- search algorithm