Restarting after Branching in the SDP Approach to MAX-CUT and Similar Combinatorial Optimization Problems.
John E. MitchellPublished in: J. Comb. Optim. (2001)
Keyphrases
- combinatorial optimization problems
- max cut
- combinatorial optimization
- knapsack problem
- optimization problems
- metaheuristic
- job shop scheduling
- ant colony optimization
- branch and bound
- traveling salesman problem
- vehicle routing problem
- graph model
- simulated annealing
- genetic algorithm
- neural network
- job shop scheduling problem
- optimal solution
- spectral graph