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]

@inproceedings{AmaldiBH05,
  title = {Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem},
  author = {Edoardo Amaldi and Pietro Belotti and Raphael Hauser},
  year = {2005},
  doi = {10.1007/11496915_19},
  url = {http://dx.doi.org/10.1007/11496915_19},
  researchr = {https://researchr.org/publication/AmaldiBH05},
  cites = {0},
  citedby = {0},
  pages = {249-264},
  booktitle = {Integer Programming and Combinatorial Optimization, 11th International IPCO Conference, Berlin, Germany, June 8-10, 2005, Proceedings},
  editor = {Michael Jünger and Volker Kaibel},
  volume = {3509},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-26199-0},
}