integrality gap
Description: The integrality gap is the difference or ratio between an integer optimization problem’s optimum and that of its linear programming relaxation.
Primary topic: Complexity and Algorithms in Graphs (70%)
Related topic: Complexity and Algorithms in Graphs (70%)
OpenAlex ID: keywords/integrality-gap
