iterative rounding
Description: An optimization method that repeatedly relaxes and rounds variables to construct discrete solutions, often for combinatorial and network-design problems.
Primary topic: Complexity and Algorithms in Graphs (66%)
Related topic: Complexity and Algorithms in Graphs (66%)
OpenAlex ID: keywords/iterative-rounding
