Integer Programming, Constraint Programming, and Hybrid Decomposition Approaches to Discretizable Distance Geometry Problems.
Moira MacNeilMerve BodurPublished in: CoRR (2019)
Keyphrases
- integer programming
- constraint programming
- combinatorial problems
- search heuristics
- np hard problems
- machine learning or data mining
- constraint satisfaction
- constraint satisfaction problems
- column generation
- finite domain
- set covering problem
- cutting plane
- integer program
- constraint propagation
- constraint problems
- cutting plane algorithm
- np hard
- global constraints
- integer programming formulations
- search strategies
- lagrangian relaxation
- propositional satisfiability
- np complete
- constraint solving
- graph coloring
- decomposition methods
- valid inequalities
- symmetry breaking
- machine learning and data mining
- arc consistency
- constraint solver
- orders of magnitude
- evolutionary algorithm
- optimization problems