Approximating bounded 0-1 integer linear programs

By David Peleg, Gideon Schechtman, Avishai Wool. 1993

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. Hanjun Dai
2. Yuyu Zhang
3. Elias Boutros Khalil
4. Le Song
5. Bistra N. Dilkina
6. Yoshua Bengio
7. Arthur Gretton
8. Kenji Fukumizu

Citations in the corpus

• Learning Combinatorial Optimization Algorithms over Graphs (2017, methodology): “We also used LP , another O (log |U| ) -approximation that solves a linear programming relaxation of SCP, and rounds the resulting fractional solution in decreasing order of variable values (SortLP-1 in [31]).”