Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem

Edoardo Amaldi, Pietro Belotti, Raphael Hauser. Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem. In Michael Jünger, Volker Kaibel, editors, Integer Programming and Combinatorial Optimization, 11th International IPCO Conference, Berlin, Germany, June 8-10, 2005, Proceedings. Volume 3509 of Lecture Notes in Computer Science, pages 249-264, Springer, 2005. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.