Mixed-integer linear programming and constraint programming formulations for solving resource availability cost problems.
Stefan KreterAndreas SchuttPeter J. StuckeyJürgen ZimmermannPublished in: Eur. J. Oper. Res. (2018)
Keyphrases
- mixed integer linear programming
- constraint programming
- cutting plane
- combinatorial problems
- resource availability
- search heuristics
- constraint problems
- branch and bound algorithm
- finite domain
- integer programming
- column generation
- integer program
- constraint satisfaction
- constraint satisfaction problems
- mathematical programming
- constraint propagation
- combinatorial optimization
- constraint solvers
- graph coloring
- production planning
- resource constraints
- solving problems
- machine learning or data mining
- symmetry breaking
- resource allocation
- lower bound
- exact solution
- approximate solutions
- soft constraints
- mixed integer
- global constraints
- branch and bound
- np complete
- objective function