Optimal Solutions for the Closest-String Problem via Integer Programming.
Cláudio Nogueira de MenesesZhaosong LuCarlos A. S. OliveiraPanos M. PardalosPublished in: INFORMS J. Comput. (2004)
Keyphrases
- integer programming
- optimal solution
- np hard
- linear programming
- column generation
- production planning
- lower bound
- constraint programming
- exact methods
- facility location
- objective function
- linear program
- cutting plane
- lagrangian relaxation
- lp relaxation
- knapsack problem
- solution quality
- set covering
- metaheuristic
- scheduling problem
- valid inequalities
- set covering problem
- ai planning
- network flow
- search space
- dantzig wolfe decomposition
- branch and bound algorithm
- feasible solution
- heuristic methods
- vehicle routing problem with time windows
- inference problems
- special case
- crew scheduling
- genetic algorithm
- efficient solutions
- approximation algorithms
- integer program
- transportation problem
- branch and bound
- vehicle routing
- cutting plane algorithm