Learning to round for discrete labeling problems
Discrete labeling problems are often solved by formulating them as an integer program, and relaxing the integrality constraint to a continuous domain. While the continuous relaxation is closely related to the original integer program, its optimal solution is often fractional. Thus, the success of a...
| Main Authors: | , , |
|---|---|
| Format: | Conference item |
| Published: |
PMLR
2018
|