{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,29]],"date-time":"2025-03-29T16:23:56Z","timestamp":1743265436973},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540261995"},{"type":"electronic","value":"9783540321026"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11496915_19","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T16:40:39Z","timestamp":1279125639000},"page":"249-264","source":"Crossref","is-referenced-by-count":11,"title":["Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem"],"prefix":"10.1007","author":[{"given":"Edoardo","family":"Amaldi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pietro","family":"Belotti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raphael","family":"Hauser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","unstructured":"Amaldi, E.: The maximum feasible subsystem problem and some applications. In: Agnetis, A., Di Pillo, G. (eds.) Modelli e Algoritmi per l\u2019ottimizzazione di sistemi complessi, Pitagora Editrice Bologna (2003)"},{"key":"19_CR2","unstructured":"Amaldi, E., Hauser, R.: Boundedness theorems for the relaxation method. Under minor revision for Mathematics of Oper. Res., available from Optimization Online"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0304-3975(94)00254-G","volume":"147","author":"E. Amaldi","year":"1995","unstructured":"Amaldi, E., Kann, V.: The complexity and approximability of finding maximum feasible subsystems of linear relations. Theoretical Computer Science\u00a0147, 181\u2013210 (1995)","journal-title":"Theoretical Computer Science"},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/s10107-002-0363-5","volume":"95","author":"E. Amaldi","year":"2003","unstructured":"Amaldi, E., Pfetsch, M.E., Trotter Jr., L.E.: On the maximum feasible subsystem problem, IISs and IIS-hypergraphs. Math. Programming A\u00a095, 533\u2013554 (2003)","journal-title":"Math. Programming A"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1287\/ijoc.9.3.311","volume":"9","author":"K.P. Bennett","year":"1997","unstructured":"Bennett, K.P., Bredensteiner, E.: A parametric optimization method for machine learning. INFORMS Journal on Computing\u00a09, 311\u2013318 (1997)","journal-title":"INFORMS Journal on Computing"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Block, H.D., Levin, S.A.: On the boundedness of an iterative procedure for solving a system of linear inequalities. In: Proceedings of AMS, pp. 229\u2013235 (1970)","DOI":"10.1090\/S0002-9939-1970-0265383-5"},{"key":"19_CR7","volume-title":"Parallel Optimization: Theory, algorithms and applications","author":"Y. Censor","year":"1997","unstructured":"Censor, Y., Zenios, S.A.: Parallel Optimization: Theory, algorithms and applications. Oxford University Press, Oxford (1997)"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1287\/ijoc.13.3.210.12632","volume":"13","author":"J. Chinneck","year":"2001","unstructured":"Chinneck, J.: Fast heuristics for the maximum feasible subsystem problem. INFORMS Journal on Computing\u00a013, 210\u2013213 (2001)","journal-title":"INFORMS Journal on Computing"},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-540-25960-2_14","volume-title":"Integer Programming and Combinatorial Optimization","author":"G. Codato","year":"2004","unstructured":"Codato, G., Fischetti, M.: Combinatorial Benders\u2019 cuts. In: Bienstock, D., Nemhauser, G.L. (eds.) IPCO 2004. LNCS, vol.\u00a03064, pp. 178\u2013195. Springer, Heidelberg (2004)"},{"key":"19_CR10","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1145\/1007352.1007404","volume-title":"Proceedings of STOC","author":"J. Dunagan","year":"2004","unstructured":"Dunagan, J., Vempala, S.: A simple polynomial-time rescaling algorithm for solving linear programs. In: Proceedings of STOC, pp. 315\u2013320. ACM Press, New York (2004)"},{"issue":"6","key":"19_CR11","doi-asserted-by":"publisher","first-page":"946","DOI":"10.1162\/neco.1992.4.6.946","volume":"4","author":"M. Frean","year":"1992","unstructured":"Frean, M.: A \u201cthermal\u201d perceptron learning rule. Neural Comp.\u00a04(6), 946\u2013957 (1992)","journal-title":"Neural Comp."},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1287\/moor.5.3.388","volume":"5","author":"J.L. Goffin","year":"1980","unstructured":"Goffin, J.L.: The relaxation method for solving systems of linear inequalities. Mathematics of Oper. Res.\u00a05, 388\u2013414 (1980)","journal-title":"Mathematics of Oper. Res."},{"key":"19_CR13","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1287\/ijoc.3.3.253","volume":"3","author":"H.J. Greenberg","year":"1991","unstructured":"Greenberg, H.J., Murphy, F.H.: Approaches to diagnosing infeasible linear programs. ORSA Journal on Computing\u00a03, 253\u2013261 (1991)","journal-title":"ORSA Journal on Computing"},{"key":"19_CR14","first-page":"1","volume":"61","author":"E.K. Lee","year":"1999","unstructured":"Lee, E.K., Gallagher, R.J., Zaider, M.: Planning implants of radionuclides for the treatment of prostate cancer: An application of MIP. Optima\u00a061, 1\u20137 (1999)","journal-title":"Optima"},{"key":"19_CR15","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/978-3-642-99789-1_13","volume-title":"Applied Mathematics and Parallel Computing","author":"O. Mangasarian","year":"1996","unstructured":"Mangasarian, O.: Machine learning via polyhedral concave minimization. In: Fischer, H., et al. (eds.) Applied Mathematics and Parallel Computing, pp. 175\u2013188. Physica-Verlag, Heidelberg (1996)"},{"key":"19_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/3-540-45129-3_37","volume-title":"Visual Form 2001","author":"M. Mattavelli","year":"2001","unstructured":"Mattavelli, M., Noel, V., Amaldi, E.: Fast line detection algorithms based on combinatorial optimization. In: Arcelli, C., Cordella, L.P., Sanniti di Baja, G. (eds.) IWVF 2001. LNCS, vol.\u00a02059, pp. 410\u2013419. Springer, Heidelberg (2001)"},{"key":"19_CR17","first-page":"301","volume":"101","author":"J. Meller","year":"2004","unstructured":"Meller, J., Wagner, M., Elber, R.: Solving huge linear programming problems for the design of protein folding potentials. Math. Programming B\u00a0101, 301\u2013318 (2004)","journal-title":"Math. Programming B"},{"key":"19_CR18","volume-title":"Perceptrons: An introduction to computational Geometry Expanded edition","author":"M.L. Minsky","year":"1988","unstructured":"Minsky, M.L., Papert, S.: Perceptrons: An introduction to computational Geometry Expanded edition. MIT Press, Cambridge (1988)"},{"key":"19_CR19","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1137\/S1052623499362111","volume":"12","author":"A. Nedi\u0107","year":"2001","unstructured":"Nedi\u0107, A., Bertsekas, D.: Incremental subgradient methods for nondifferentiable optimization. SIAM J. on Optimization\u00a012, 109\u2013138 (2001)","journal-title":"SIAM J. on Optimization"},{"key":"19_CR20","unstructured":"Pfetsch, M.E.: The maximum feasible subsystem problem and vertex-facet incidences of polyhedra. PhD thesis, Dep. of Mathematics, Technische Universit\u00e4t Berlin (October 2002)"},{"key":"19_CR21","volume-title":"Inherently parallel algorithms in feasibility and other applications","author":"B.T. Polyak","year":"2001","unstructured":"Polyak, B.T.: Random algorithms for solving convex inequalities. In: Butnariu, D., et al. (eds.) Inherently parallel algorithms in feasibility and other applications. Elsevier, Amsterdam (2001)"},{"issue":"3","key":"19_CR22","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1023\/A:1014915519359","volume":"107","author":"F. Rossi","year":"2001","unstructured":"Rossi, F., Sassano, A., Smriglio, S.: Models and algorithms for terrestrial digital broadcasting. Ann. of Oper. Res.\u00a0107(3), 267\u2013283 (2001)","journal-title":"Ann. of Oper. Res."},{"key":"19_CR23","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley & Sons, Chichester (1986)"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11496915_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T02:52:08Z","timestamp":1685674328000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11496915_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540261995","9783540321026"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/11496915_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}