31 citations · 69 across the 12 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2000★ 2 cited
When Does the Positive Semidefiniteness Constraint Help In Lifting Procedures
Levent Tuncel, Michel X. Goemans
We study the lift-and-project procedures of Lovász and Schrijver for 0-1 integer programming problems. We prove that the procedure using the positive semidefiniteness constraint is…
math.CO1994
Number of faults a system can withstand without repairs
Michel Goemans, Nancy Lynch, Isaac Saias
We consider the following scheduling problem. A system is composed of processors drawn from a pool of . The processors can become faulty while in operation and faulty proces…