Phase transition for cutting-plane approach to vertex-cover problem

Timo Dewenter Alexander K. Hartmann

Published in: CoRR (2012)

Keyphrases

phase transition
vertex cover
cutting plane
approximation algorithms
integer programming
lower bound
constraint satisfaction
column generation
partial order
planar graphs
knapsack problem
mixed integer
np hard
np complete
integer program
valid inequalities
special case
genetic algorithm
optimal solution