A new bound for the ratio between the 2-matching problem and its linear programming relaxation.
Sylvia C. BoydRobert CarrPublished in: Math. Program. (1999)
Keyphrases
- linear programming relaxation
- integer solution
- lower bound
- worst case analysis
- branch and bound
- knapsack problem
- linear programming
- upper bound
- integer programming
- integrality gap
- column generation
- integer program
- arbitrarily close
- mixed integer programming
- feasible solution
- linear complementarity problem
- reinforcement learning
- lower and upper bounds
- worst case
- np hard
- search algorithm
- branch and bound algorithm
- cutting plane
- constant factor
- approximation algorithms
- valid inequalities
- computational complexity
- objective function
- neural network