Integer programming formulation of combinatorial optimization problems.
Toshimde IbarakiPublished in: Discret. Math. (1976)
Keyphrases
- combinatorial optimization problems
- integer programming formulation
- knapsack problem
- linear programming relaxation
- valid inequalities
- traveling salesman problem
- randomly generated
- randomly generated problems
- combinatorial optimization
- tabu search algorithm
- lp relaxation
- job shop scheduling problem
- optimization problems
- branch and bound algorithm
- ant colony optimization
- metaheuristic
- cutting plane
- branch and bound
- optimal solution
- exact algorithms
- greedy algorithm
- linear programming
- dynamic programming
- lower bound
- mixed integer
- evolutionary algorithm
- np hard
- mixed integer programming
- production planning
- boolean functions
- vehicle routing problem
- convex hull
- np complete