{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:06:40Z","timestamp":1759666000989},"reference-count":44,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,4,1]],"date-time":"2002-04-01T00:00:00Z","timestamp":1017619200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4125,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2002,4]]},"DOI":"10.1016\/s0166-218x(01)00260-8","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T11:12:20Z","timestamp":1034593940000},"page":"115-143","source":"Crossref","is-referenced-by-count":36,"title":["The MIN PFS problem and piecewise linear model estimation"],"prefix":"10.1016","volume":"118","author":[{"given":"Edoardo","family":"Amaldi","sequence":"first","affiliation":[]},{"given":"Marco","family":"Mattavelli","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(01)00260-8_BIB1","series-title":"Simulated Annealing and Boltzmannn Machines","author":"Aarts","year":"1989"},{"key":"10.1016\/S0166-218X(01)00260-8_BIB2","doi-asserted-by":"crossref","first-page":"382","DOI":"10.4153\/CJM-1954-037-2","article-title":"The relaxation method for linear inequalities","volume":"6","author":"Agmon","year":"1954","journal-title":"Canadian J. Math."},{"key":"10.1016\/S0166-218X(01)00260-8_BIB3","unstructured":"E. Amaldi, From finding maximum feasible subsystems of linear systems to feedforward neural network design, Ph.D. Thesis No. 1272, Department of Mathematics, Swiss Federal Institute of Technology, Lausanne, 1994."},{"key":"10.1016\/S0166-218X(01)00260-8_BIB4","unstructured":"E. Amaldi, R. Hauser, Randomized relaxation methods for the maximum feasible subsystem problem, Technical Report, N. 2001-90, DEI, Politecnico di Milano, Italy, 2001."},{"issue":"1\u20132","key":"10.1016\/S0166-218X(01)00260-8_BIB5","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0304-3975(94)00254-G","article-title":"The complexity and approximability of finding maximum feasible subsystems of linear relations","volume":"147","author":"Amaldi","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0166-218X(01)00260-8_BIB6","unstructured":"E. Amaldi, M. Mattavelli, A combinatorial optimization approach to extract piecewise linear structure from non-linear data and an application to optical flow segmentation, Technical Report 97-12, Cornell Computational Optimization project, Cornell University, Ithaca NY, 1997."},{"key":"10.1016\/S0166-218X(01)00260-8_BIB7","series-title":"Proceeding of the 10th Integer Programming and Combinatorial Optimization conference (IPCO\u201999)","first-page":"45","article-title":"Some structural and algorithmic properties of the maximum feasible subsystem problem","volume":"Vol. 1610","author":"Amaldi","year":"1999"},{"key":"10.1016\/S0166-218X(01)00260-8_BIB8","series-title":"An Exploration of Chaos","author":"Argyris","year":"1994"},{"key":"10.1016\/S0166-218X(01)00260-8_BIB9","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/0020-0190(87)90114-1","article-title":"Occam's razor","volume":"24","author":"Blumer","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(01)00260-8_BIB10","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1023\/A:1008324625522","article-title":"k-Plane clustering","volume":"16","author":"Bradley","year":"2000","journal-title":"J. Global Optim."},{"key":"10.1016\/S0166-218X(01)00260-8_BIB11","series-title":"Parallel Optimization: Theory, Algorithms and Applications","author":"Censor","year":"1997"},{"key":"10.1016\/S0166-218X(01)00260-8_BIB12","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1287\/ijoc.13.3.210.12632","article-title":"Fast heuristics for the maximum feasible subsystem problem","volume":"13","author":"Chinneck","year":"2001","journal-title":"INFORMS J. Comput."},{"issue":"6","key":"10.1016\/S0166-218X(01)00260-8_BIB13","doi-asserted-by":"crossref","first-page":"946","DOI":"10.1162\/neco.1992.4.6.946","article-title":"A \u201cthermal\u201d perceptron learning rule","volume":"4","author":"Frean","year":"1992","journal-title":"Neural Comput."},{"key":"10.1016\/S0166-218X(01)00260-8_BIB14","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0166-218X(01)00260-8_BIB15","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1287\/moor.5.3.388","article-title":"The relaxation method for solving systems of linear inequalities","volume":"5","author":"Goffin","year":"1980","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00260-8_BIB16","series-title":"Trees and Hills: Methodology for Maximizing Functions of Systems of Linear Relations","volume":"Vol. 22","author":"Greer","year":"1984"},{"key":"10.1016\/S0166-218X(01)00260-8_BIB17","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF02614317","article-title":"Clustering analysis and mathematical programming","volume":"79","author":"Hansen","year":"1997","journal-title":"Math. Programming B"},{"issue":"5","key":"10.1016\/S0166-218X(01)00260-8_BIB18","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1109\/TPAMI.1987.4767964","article-title":"The adaptive Hough transform","volume":"PAMI-9","author":"Illingworth","year":"1987","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/S0166-218X(01)00260-8_BIB19","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/S0734-189X(88)80033-1","article-title":"A survey of the Hough transform","volume":"44","author":"Illingworth","year":"1988","journal-title":"Comput. Vision Graphics Image Process."},{"key":"10.1016\/S0166-218X(01)00260-8_BIB20","doi-asserted-by":"crossref","first-page":"1464","DOI":"10.1109\/5.58325","article-title":"The self organizing map","volume":"78","author":"Kohonen","year":"1990","journal-title":"Proc. IEEE"},{"key":"10.1016\/S0166-218X(01)00260-8_BIB21","first-page":"331","article-title":"A new curve detection method: randomized Hough transform","volume":"11","author":"Kultaken","year":"1995","journal-title":"Pattern Recognition Lett."},{"issue":"2","key":"10.1016\/S0166-218X(01)00260-8_BIB22","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1006\/ciun.1993.1041","article-title":"Which Hough transform?","volume":"58","author":"Leavers","year":"1993","journal-title":"CVGIP: Image Understanding"},{"key":"10.1016\/S0166-218X(01)00260-8_BIB23","first-page":"1","article-title":"Planning implants of radionuclides for the treatment of prostate cancer: an application of mixed integer programming","volume":"61","author":"Lee","year":"1999","journal-title":"Optima"},{"key":"10.1016\/S0166-218X(01)00260-8_BIB24","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/BF01096681","article-title":"Misclassification minimization","volume":"5","author":"Mangasarian","year":"1994","journal-title":"J. Global Optim."},{"key":"10.1016\/S0166-218X(01)00260-8_BIB25","doi-asserted-by":"crossref","unstructured":"M. Mattavelli, Motion analysis and estimation: from ill-posed discrete inverse linear problems to MPEG-2 coding, Ph.D. Thesis No. 1597, Communication Systems Division, Swiss Federal Institute of Technology, Lausanne, 1997.","DOI":"10.1016\/S0165-1684(97)89610-7"},{"key":"10.1016\/S0166-218X(01)00260-8_BIB26","unstructured":"M. Mattavelli, V. Noel, E. Amaldi, A new efficient line detection algorithm based on combinatorial optimization techniques, Proceedings of the 1998 International Conference on Image Processing (ICIP98), Chicago, Illinois, October 4\u20137 1998, IEEE Signal Processing Society."},{"key":"10.1016\/S0166-218X(01)00260-8_BIB27","doi-asserted-by":"crossref","unstructured":"M. Mattavelli, V. Noel, E. Amaldi, A new approach for fast line detection based on combinatorial optimization, Proceedings of ICIAP99, International Conference on Image Analysis and Processing, Venice, Italy, September 27\u201329, 1999, pp. 168\u2013173.","DOI":"10.1109\/ICIAP.1999.797589"},{"key":"10.1016\/S0166-218X(01)00260-8_BIB28","doi-asserted-by":"crossref","unstructured":"M. Mattavelli, V. Noel, E. Amaldi, Fast line detection algorithms based on combinatorial optimization, Proceedings of the 4th International Workshop on Visual Form (IWVF4), Capri, Italy, Lecture Notes in Computer Science, eds. C. Arcelli and L.P. Cordella and G. Sanniti di Baja, Springer, Berlin, 2001, pp. 410\u2013419.","DOI":"10.1007\/3-540-45129-3_37"},{"key":"10.1016\/S0166-218X(01)00260-8_BIB29","series-title":"Perceptrons: An Introduction to Computational Geometry","author":"Minsky","year":"1988"},{"key":"10.1016\/S0166-218X(01)00260-8_BIB30","doi-asserted-by":"crossref","first-page":"393","DOI":"10.4153\/CJM-1954-038-x","article-title":"The relaxation method for linear inequalities","volume":"6","author":"Motzkin","year":"1954","journal-title":"Canadian J. Math."},{"key":"10.1016\/S0166-218X(01)00260-8_BIB31","unstructured":"E. Oja, H. Kalviainen, P. Hirvonen, Houghtool a software package for Hough transform calculation, Ninth Scandinavian Conference on Image Analysis, Uppsala, Sweden, 1995, pp. 841\u2013848, http:\/\/www.lut.fi\/dep\/tite\/XHoughtool\/xhoughtool.html."},{"key":"10.1016\/S0166-218X(01)00260-8_BIB32","doi-asserted-by":"crossref","unstructured":"P. Palmer, M. Petrou, J. Kittler, A Hough transform algorithm with a 2-D hypothesis testing kernel, CVGIP 58(2)(Image Understanding) (1993) 221\u2013234.","DOI":"10.1006\/ciun.1993.1039"},{"key":"10.1016\/S0166-218X(01)00260-8_BIB33","unstructured":"M. Parker, A set covering approach to infeasibility analysis of linear programming problems and related issues, Ph.D. Thesis, Dep. of Mathematics, University of Colorado at Denver, 1995."},{"key":"10.1016\/S0166-218X(01)00260-8_BIB34","series-title":"Inherently Parallel Algorithms in Feasibility and Other Applications","article-title":"Random algorithms for solving convex inequalities","author":"Polyak","year":"2001"},{"key":"10.1016\/S0166-218X(01)00260-8_BIB35","series-title":"Finding Groups in Data","author":"Rousseeuw","year":"1990"},{"key":"10.1016\/S0166-218X(01)00260-8_BIB36","series-title":"Robust Regression and Outlier Detection","author":"Rousseeuw","year":"1987"},{"key":"10.1016\/S0166-218X(01)00260-8_BIB37","first-page":"17","article-title":"Transversals of IIS-hypergraphs","volume":"81","author":"Ryan","year":"1991","journal-title":"Congr. Numer."},{"key":"10.1016\/S0166-218X(01)00260-8_BIB38","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1016\/0377-2217(82)90071-6","article-title":"On relaxation methods for systems of linear inequalities","volume":"9","author":"Telgen","year":"1982","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00260-8_BIB39","series-title":"Threshold Models in Nonlinear Time Series Analysis","author":"Tong","year":"1983"},{"key":"10.1016\/S0166-218X(01)00260-8_BIB40","series-title":"Nonlinear Time Series","author":"Tong","year":"1990"},{"key":"10.1016\/S0166-218X(01)00260-8_BIB41","doi-asserted-by":"crossref","unstructured":"J.-M. Vesin, A common generalization framework for two classical nonlinear models, Proceedings of International Workshop on Nonlinear Digital Signal Processing, Tampere, Finland, 1993, pp. 6\u20132.3.","DOI":"10.1109\/NDSP.1993.767741"},{"key":"10.1016\/S0166-218X(01)00260-8_BIB42","unstructured":"J.-M. Vesin, M. Mattavelli, E. Amaldi, A new approach to piecewise linear modeling based on a combinatorial optimization formulation, Physica D, under revision."},{"issue":"5","key":"10.1016\/S0166-218X(01)00260-8_BIB43","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1016\/0167-8655(90)90042-Z","article-title":"A new curve detection method: randomized Hough transform","volume":"11","author":"Xu","year":"1990","journal-title":"Pattern Recognition Lett."},{"key":"10.1016\/S0166-218X(01)00260-8_BIB44","first-page":"1541","article-title":"A fast Hough transform for segment detection","volume":"4\u201311","author":"Zapata","year":"1995","journal-title":"IEEE Trans. Image Process."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01002608?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01002608?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T00:10:51Z","timestamp":1578442251000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X01002608"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,4]]},"references-count":44,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,4]]}},"alternative-id":["S0166218X01002608"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(01)00260-8","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2002,4]]}}}