A Logarithmic Integrality Gap for Generalizations of Quasi-Bipartite Instances of Directed Steiner Tree.
Zachary FriggstadHao SunPublished in: SWAT (2024)
Keyphrases
- linear programming relaxation
- steiner tree
- integrality gap
- knapsack problem
- lower bound
- linear programming
- valid inequalities
- mixed integer programming
- column generation
- branch and bound
- integer programming
- integer programming formulation
- feasible solution
- integer program
- linear program
- bipartite graph
- worst case
- cutting plane
- mixed integer
- optimization problems
- lower and upper bounds
- primal dual
- randomly generated
- np hard
- branch and bound algorithm
- undirected graph
- production planning
- approximation algorithms
- traveling salesman problem
- evolutionary algorithm
- search space
- upper bound
- genetic algorithm