Ideal polytopes and face structures of some combinatorial optimization problems.
Yoshiko IkebeAkihisa TamuraPublished in: Math. Program. (1995)
Keyphrases
- combinatorial optimization problems
- combinatorial optimization
- optimization problems
- discrete optimization
- metaheuristic
- knapsack problem
- ant colony optimization
- job shop scheduling
- continuous optimization problems
- human faces
- shortest path problem
- convex hull
- traveling salesman problem
- vehicle routing problem
- facial expressions
- branch and bound
- simulated annealing
- job shop scheduling problem
- np hard
- evolutionary algorithm
- minmax regret
- query expansion
- linear programming
- special case