{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T21:45:10Z","timestamp":1648503910914},"reference-count":20,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1987,1,1]],"date-time":"1987-01-01T00:00:00Z","timestamp":536457600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[1987,1]]},"DOI":"10.1016\/0305-0548(87)90040-2","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T16:15:45Z","timestamp":1056989745000},"page":"435-447","source":"Crossref","is-referenced-by-count":3,"title":["Comparison of mathematical programming software: A case study using discrete L1 approximation codes"],"prefix":"10.1016","volume":"14","author":[{"given":"P.D.","family":"Domich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.L.","family":"Hoffman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.H.F.","family":"Jackson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.B.","family":"Saunders","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.R.","family":"Shier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(87)90040-2_BIB1","first-page":"106","article-title":"On the analysis and comparison of mathematical programming techniques","volume":"Vol. 502","author":"Dembo","year":"1978"},{"key":"10.1016\/0305-0548(87)90040-2_BIB2","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1080\/03610917708812053","article-title":"Methodology and analysis for comparing discrete linear L1 approximation codes","volume":"B6","author":"Gilsinn","year":"1977","journal-title":"Commun. Statist."},{"key":"10.1016\/0305-0548(87)90040-2_BIB3","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1080\/03610917708812047","article-title":"Least absolute values estimation: an introduction","volume":"B6","author":"Gentle","year":"1977","journal-title":"Commun. Statist."},{"key":"10.1016\/0305-0548(87)90040-2_BIB4","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1137\/1006061","article-title":"Norms for smoothing and estimation","volume":"6","author":"Rice","year":"1964","journal-title":"SIAM Rev."},{"key":"10.1016\/0305-0548(87)90040-2_BIB5","doi-asserted-by":"crossref","first-page":"1887","DOI":"10.1214\/aoms\/1177693054","article-title":"A general qualitative definition of robustness","volume":"42","author":"Hampel","year":"1971","journal-title":"Ann. Mathemat. Statist."},{"key":"10.1016\/0305-0548(87)90040-2_BIB6","doi-asserted-by":"crossref","first-page":"829","DOI":"10.1080\/03610927708827534","article-title":"Nonuniqueness of least absolute values regression","volume":"A6","author":"Harter","year":"1977","journal-title":"Commun. Statist."},{"key":"10.1016\/0305-0548(87)90040-2_BIB7","series-title":"Interpolation and Approximation","author":"Davis","year":"1965"},{"key":"10.1016\/0305-0548(87)90040-2_BIB8","series-title":"The Approximation of Functions","author":"Rice","year":"1964"},{"key":"10.1016\/0305-0548(87)90040-2_BIB9","series-title":"Theory of Approximation of Functions of a Real Variable","author":"Timan","year":"1963"},{"key":"10.1016\/0305-0548(87)90040-2_BIB10","first-page":"74","article-title":"Generation and use of orthogonal polynomials for data-fitting with a digital computer","volume":"5","author":"Forsythe","year":"1957","journal-title":"SIAM J."},{"key":"10.1016\/0305-0548(87)90040-2_BIB11","article-title":"A collection of test problems for discrete linear L1 data fitting","author":"Shier","year":"1979","journal-title":"National Bureau of Standards Internal Report NBSIR 79-1920"},{"key":"10.1016\/0305-0548(87)90040-2_BIB12","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/BF01580112","article-title":"On L1 and Chebyshev estimation","volume":"5","author":"Appa","year":"1973","journal-title":"Mathemat. Programmg"},{"key":"10.1016\/0305-0548(87)90040-2_BIB13","doi-asserted-by":"crossref","first-page":"839","DOI":"10.1137\/0710069","article-title":"An improved algorithm for discrete L1 linear approximation","volume":"10","author":"Barrodale","year":"1973","journal-title":"SIAM J. Numer. Anal."},{"key":"10.1016\/0305-0548(87)90040-2_BIB14","doi-asserted-by":"crossref","first-page":"839","DOI":"10.1080\/03610927708827535","article-title":"On least absolute values estimation","volume":"A6","author":"Gentle","year":"1977","journal-title":"Commun. Statist."},{"key":"10.1016\/0305-0548(87)90040-2_BIB15","first-page":"844","article-title":"An efficient method for the discrete linear L1 approximation problem","volume":"29","author":"Abdelmalek","year":"1975","journal-title":"Mathemat. Computn"},{"key":"10.1016\/0305-0548(87)90040-2_BIB16","doi-asserted-by":"crossref","first-page":"328","DOI":"10.2307\/2285306","article-title":"A comparison of two algorithms for absolute deviation curve fitting","volume":"71","author":"Armstrong","year":"1976","journal-title":"J. Am. statist. Ass."},{"key":"10.1016\/0305-0548(87)90040-2_BIB17","first-page":"319","article-title":"Solution of an overdetermined system of equations in the L1 norm","volume":"17","author":"Barrodale","year":"1974","journal-title":"Commun. Ass. Computg Machin."},{"key":"10.1016\/0305-0548(87)90040-2_BIB18","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1137\/0715015","article-title":"Minimization techniques for piecewise differentiable functions: the L1 solution to an overdetermined linear system","volume":"15","author":"Bartels","year":"1978","journal-title":"SIAM J. Numer. Anal."},{"key":"10.1016\/0305-0548(87)90040-2_BIB19","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1145\/355921.355929","article-title":"A test problem generator for discrete linear L1 approximation problems","volume":"6","author":"Hoffman","year":"1980","journal-title":"ACM Transact. Mathemat. Software"},{"key":"10.1016\/0305-0548(87)90040-2_BIB20","doi-asserted-by":"crossref","first-page":"455","DOI":"10.6028\/jres.084.023","article-title":"Generators for discrete polynomial L1 approximation problems","volume":"84","author":"Domich","year":"1979","journal-title":"J. Res. natn. Bur. Stand."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054887900402?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054887900402?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T16:56:17Z","timestamp":1552928177000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054887900402"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,1]]},"references-count":20,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1987,1]]}},"alternative-id":["0305054887900402"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(87)90040-2","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1987,1]]}}}