New lower bounds based on column generation and constraint programming for the pattern minimization problem.
Cláudio AlvesRita MacedoJosé M. Valério de CarvalhoPublished in: Comput. Oper. Res. (2009)
Keyphrases
- column generation
- constraint programming
- lower bound
- branch and bound
- linear programming relaxation
- objective function
- lagrangian relaxation
- cutting plane
- combinatorial problems
- integer programming
- upper bound
- vehicle routing
- constraint propagation
- constraint satisfaction
- constraint satisfaction problems
- integer linear programming
- exact solution
- integer program
- mixed integer programming
- optimal solution
- branch and bound algorithm
- symmetry breaking
- global constraints
- set partitioning
- search heuristics
- search strategies
- linear program
- worst case
- np hard
- finite domain
- valid inequalities
- vehicle routing problem with time windows
- cutting plane algorithm
- search algorithm
- lower and upper bounds
- arc consistency
- sequential patterns
- linear programming
- search space