Random restricted matching and lower bounds for combinatorial optimization.
Stefan SteinerbergerPublished in: J. Comb. Optim. (2012)
Keyphrases
- combinatorial optimization
- lower bound
- branch and bound
- branch and bound algorithm
- quadratic assignment problem
- metaheuristic
- simulated annealing
- traveling salesman problem
- combinatorial optimization problems
- combinatorial problems
- upper bound
- optimization problems
- matching algorithm
- mathematical programming
- hard combinatorial optimization problems
- graph matching
- objective function
- neural network
- max flow min cut
- shape matching
- tabu search
- np hard
- graph theory
- phase transition
- worst case
- lower and upper bounds
- lagrangian relaxation
- exact algorithms
- single machine scheduling problem
- search algorithm
- genetic algorithm