{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T00:44:29Z","timestamp":1648687469660},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1991,7,1]],"date-time":"1991-07-01T00:00:00Z","timestamp":678326400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ZOR - Methods and Models of Operations Research"],"published-print":{"date-parts":[[1991,7]]},"DOI":"10.1007\/bf01417518","type":"journal-article","created":{"date-parts":[[2005,4,3]],"date-time":"2005-04-03T08:25:46Z","timestamp":1112516746000},"page":"299-307","source":"Crossref","is-referenced-by-count":1,"title":["Linear programming by minimizing distances"],"prefix":"10.1007","volume":"35","author":[{"given":"U.","family":"Betke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Henk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","first-page":"176","volume-title":"Math Forschber","author":"U Betke","year":"1986","unstructured":"Betke U, Gritzmann P (1986) Projection algorithms for linear programming. Math Forschber Univ Siegen, Siegen, p 176"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1145\/1057947.1057951","volume":"20","author":"J Dongarra","year":"1985","unstructured":"Dongarra J, Grosse E (1985) Distribution of mathematical software via electronic mail. Signum Newsletter 20:45?47","journal-title":"Signum Newsletter"},{"key":"CR3","volume-title":"Linear programming and extensions","author":"G Dantzig","year":"1974","unstructured":"Dantzig G (1974) Linear programming and extensions. Princeton University Press, Princeton NJ"},{"key":"CR4","volume-title":"Nonlinear programming: Sequential unconstrained minimization techniques","author":"A Fiacco","year":"1968","unstructured":"Fiacco A, McCormick G (1968) Nonlinear programming: Sequential unconstrained minimization techniques. Wiley, New York"},{"key":"CR5","volume-title":"Practical methods of optimization","author":"R Fletcher","year":"1980","unstructured":"Fletcher R (1980) Practical methods of optimization. Wiley, Chichester"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF02592025","volume":"36","author":"P Gill","year":"1986","unstructured":"Gill P et al. (1986) On projected Newton barrier methods for linear programming and an equivalence to Karmarkar's projective method. Math Prog 36:183?209","journal-title":"Math Prog"},{"key":"CR7","volume-title":"Matrix computations","author":"G Golub","year":"1983","unstructured":"Golub G, Van Loan C (1983) Matrix computations. North Oxford Academic, Oxford"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N Karmarkar","year":"1984","unstructured":"Karmarkar N (1984) A new polynomial-time algorithm for linear programming. Combinatorica 4:373?395","journal-title":"Combinatorica"},{"key":"CR9","first-page":"51","volume":"20","author":"LG Khachiyan","year":"1980","unstructured":"Khachiyan LG (1980) Polynomial algorithms in linear programming (in Russian), Zhurnal V ychislitel'noi Matematiki i Matematicheskoi Fiziki 20:51?68. [English translation: USSR Computational Mathematics and Mathematical Physics 20:53?72]","journal-title":"Zhurnal V ychislitel'noi Matematiki i Matematicheskoi Fiziki"}],"container-title":["ZOR Zeitschrift f\ufffd Operations Research Methods and Models of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01417518.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01417518\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01417518","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T13:13:01Z","timestamp":1556802781000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01417518"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,7]]},"references-count":9,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1991,7]]}},"alternative-id":["BF01417518"],"URL":"https:\/\/doi.org\/10.1007\/bf01417518","relation":{},"ISSN":["0340-9422","1432-5217"],"issn-type":[{"value":"0340-9422","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,7]]}}}