{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,9]],"date-time":"2023-04-09T23:40:07Z","timestamp":1681083607327},"reference-count":20,"publisher":"Elsevier BV","issue":"13","license":[{"start":{"date-parts":[[2000,11,1]],"date-time":"2000-11-01T00:00:00Z","timestamp":973036800000},"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 &amp; Operations Research"],"published-print":{"date-parts":[[2000,11]]},"DOI":"10.1016\/s0305-0548(99)00075-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:59:16Z","timestamp":1027612756000},"page":"1303-1324","source":"Crossref","is-referenced-by-count":5,"title":["Piecewise linear programming via interior points"],"prefix":"10.1016","volume":"27","author":[{"given":"Mario Conrado","family":"Cavichia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcos Nereu","family":"Arenales","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(99)00075-1_BIB1","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","article-title":"A new polynomial-time algorithm for linear programming","volume":"4","author":"Karmarkar","year":"1984","journal-title":"Combinatorica"},{"key":"10.1016\/S0305-0548(99)00075-1_BIB2","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF01759039","article-title":"Search directions for interior linear programming methods","volume":"6","author":"Gonzaga","year":"1991","journal-title":"Algorithmica"},{"key":"10.1016\/S0305-0548(99)00075-1_BIB3","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1007\/BF01582902","article-title":"A survey of search directions in interior point methods for linear programming","volume":"52","author":"Hertog","year":"1991","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0305-0548(99)00075-1_BIB4","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BF01587095","article-title":"An implementation of Karmarkar's algorithm for linear programming","volume":"44","author":"Adler","year":"1989","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0305-0548(99)00075-1_BIB5","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/BF02023048","article-title":"A unified view of interior point methods for linear programming","volume":"22","author":"Shanno","year":"1990","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0305-0548(99)00075-1_BIB6","doi-asserted-by":"crossref","unstructured":"Monteiro RDC, Adler I. Interior path following primal-dual algorithms, part II \u2013 convex quadratic programming Mathematical Programming 1989; 44:43\u20136.","DOI":"10.1007\/BF01587076"},{"key":"10.1016\/S0305-0548(99)00075-1_BIB7","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1007\/BF02275347","article-title":"On the formulation and theory of the Newton interior-point method for non-linear programming","volume":"89","author":"Tapia","year":"1996","journal-title":"Journal of Optimization Theory and Applications"},{"key":"10.1016\/S0305-0548(99)00075-1_BIB8","unstructured":"Golstein E, Youdine ET. Probl\u00e8mes particuliers de la programmation lin\u00e9aire. Moscou: \u00c9ditions MIR, 1966."},{"key":"10.1016\/S0305-0548(99)00075-1_BIB9","doi-asserted-by":"crossref","unstructured":"Fourer RA. Simplex algorithm for piecewise-linear programming I \u2013 derivation and proof. Mathematical Programming 1985; 33:204\u201333.","DOI":"10.1007\/BF01582246"},{"key":"10.1016\/S0305-0548(99)00075-1_BIB10","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF01580769","article-title":"Simplex algorithm for piecewise-linear programming II \u2013 finiteness, feasibility and degeneracy","volume":"41","author":"Fourer","year":"1988","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0305-0548(99)00075-1_BIB11","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/BF01585703","article-title":"Simplex algorithm for piecewise-linear programming III \u2013 computational analysis and applications","volume":"53","author":"Fourer","year":"1992","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0305-0548(99)00075-1_BIB12","unstructured":"Zhang Y. A primal-dual interior point approach for computing the L1 and L\u221e solutions of overdetermined linear systems. Technical Report, Dept. of Math. Stat., University of Maryland, Baltimore County Campus, Baltimore, 1990."},{"key":"10.1016\/S0305-0548(99)00075-1_BIB13","doi-asserted-by":"crossref","unstructured":"Ruzinski SA, Olsen ET. L1 and L\u221e minimization via a Karmarkar's algorithm. IEEE Transations on Ascoustics Speech and Signal Processing 1989;37:245\u201353.","DOI":"10.1109\/29.21687"},{"key":"10.1016\/S0305-0548(99)00075-1_BIB14","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1002\/1520-6750(198810)35:5<473::AID-NAV3220350511>3.0.CO;2-#","article-title":"An assumption-free convergence analysis for a perturbation of the scaling algorithm for linear programs with application to the L1 estimation problem","volume":"35","author":"Sherali","year":"1988","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0305-0548(99)00075-1_BIB15","doi-asserted-by":"crossref","unstructured":"Barrodale I, Young A. Algorithms for best L1 and L\u221e linear approximations on a discrete set. Numerische Mathematik 1966;8:295\u2013306.","DOI":"10.1007\/BF02162565"},{"key":"10.1016\/S0305-0548(99)00075-1_BIB16","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 Journal of Numerical Analysis"},{"key":"10.1016\/S0305-0548(99)00075-1_BIB17","unstructured":"Fran\u00e7a PM, Fernandes JFR, e Tavares HMF. Expans\u00e3o de redes telef\u00f4nicas. SBA: Controle & Automa\u00e7\u00e3o 1987;3:1."},{"key":"10.1016\/S0305-0548(99)00075-1_BIB18","unstructured":"Fourer R. Notes on semi-linear programming, informal report. Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, IL, 1981."},{"key":"10.1016\/S0305-0548(99)00075-1_BIB19","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1080\/03610917908812113","article-title":"A revised simplex algorithm for the absolute deviation curve fitting problem","volume":"B.8","author":"Armstrong","year":"1979","journal-title":"Communications in Statistics"},{"key":"10.1016\/S0305-0548(99)00075-1_BIB20","unstructured":"Murty KG. Linear and combinatorial programming. New York: Wiley, 1976."}],"container-title":["Computers &amp; Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054899000751?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054899000751?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,9]],"date-time":"2023-04-09T23:10:17Z","timestamp":1681081817000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054899000751"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,11]]},"references-count":20,"journal-issue":{"issue":"13","published-print":{"date-parts":[[2000,11]]}},"alternative-id":["S0305054899000751"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(99)00075-1","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2000,11]]}}}