Integrality gap of the hypergraphic relaxation of Steiner trees: A short proof of a 1.55 upper bound.
Deeparnab ChakrabartyJochen KönemannDavid PritchardPublished in: Oper. Res. Lett. (2010)
Keyphrases
- steiner tree
- linear programming relaxation
- integrality gap
- upper bound
- lower bound
- branch and bound
- tight upper and lower bounds
- branch and bound algorithm
- linear programming
- lower and upper bounds
- knapsack problem
- np hard
- optimal solution
- worst case
- objective function
- column generation
- valid inequalities
- mixed integer programming
- feasible solution
- integer programming
- lagrangian relaxation
- cutting plane
- integer program
- constant factor
- integer programming formulation
- traveling salesman problem
- mathematical model
- arbitrarily close