Integer Linear Programs and Local Search for Max-Cut.
Svatopluk PoljakPublished in: SIAM J. Comput. (1995)
Keyphrases
- linear program
- max cut
- np hard
- optimal solution
- extreme points
- linear programming
- graph model
- planar graphs
- search algorithm
- search space
- integer program
- job shop scheduling problem
- np complete problems
- genetic algorithm
- memetic algorithm
- scheduling problem
- dynamic programming
- primal dual
- graph partitioning
- knapsack problem
- spectral graph
- mixed integer
- column generation
- minimum cost
- approximation algorithms
- feasible solution
- combinatorial optimization
- integer programming
- tabu search
- metaheuristic
- np complete
- special case
- lower bound
- data clustering
- binary variables
- simulated annealing
- objective function
- convex functions