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