A Bound on the Expected Optimality of Random Feasible Solutions to Combinatorial Optimization Problems.
Evan SultanikPublished in: CoRR (2014)
Keyphrases
- combinatorial optimization problems
- feasible solution
- optimal solution
- knapsack problem
- metaheuristic
- tabu search
- integer solution
- lower bound
- optimization problems
- objective function
- combinatorial optimization
- discrete optimization
- linear programming relaxation
- linear programming
- solution quality
- ant colony optimization
- upper bound
- mathematical model
- lagrangian relaxation
- vehicle routing problem
- np hard
- solution space
- mixed integer
- test problems
- branch and bound
- search space
- exact algorithms
- simulated annealing
- job shop scheduling problem
- traveling salesman problem
- branch and bound algorithm
- mixed integer program
- nsga ii
- convex hull
- evolutionary algorithm
- multi objective
- particle swarm optimization
- worst case
- multidimensional knapsack problem
- genetic algorithm
- search algorithm
- linear complementarity problem