{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T14:26:53Z","timestamp":1747319213013},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1981,12,1]],"date-time":"1981-12-01T00:00:00Z","timestamp":376012800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1981,12]]},"DOI":"10.1007\/bf01584235","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:29:50Z","timestamp":1114676990000},"page":"121-136","source":"Crossref","is-referenced-by-count":24,"title":["Polynomial algorithms for a class of linear programs"],"prefix":"10.1007","volume":"21","author":[{"given":"J. F.","family":"Maurras","sequence":"first","affiliation":[]},{"given":"K.","family":"Truemper","sequence":"additional","affiliation":[]},{"given":"M.","family":"Akg\u00fcl","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"382","DOI":"10.4153\/CJM-1954-037-2","volume":"6","author":"S. Agmon","year":"1954","unstructured":"S. Agmon, \u201cThe relaxation method for linear inequalities\u201d,Canadian Journal of Mathematics 6 (1954) 382\u2013392.","journal-title":"Canadian Journal of Mathematics"},{"key":"CR2","unstructured":"S.A. Cook, \u201cThe complexity of theorem proving procedures\u201d, in:Conf. Rec. of 3rd ACM Symposium on Theory of Computing (1970) 151\u2013158."},{"key":"CR3","volume-title":"Linear programming and extensions","author":"G.B. Dantzig","year":"1963","unstructured":"G.B. Dantzig,Linear programming and extensions (Princeton University Press, Princeton, NJ, 1963)."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"J. Edmonds, \u201cPaths, trees, and flowers\u201d,Canadian Journal of Mathematics 17 (1965) 449\u2013467.","journal-title":"Canadian Journal of Mathematics"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"241","DOI":"10.6028\/jres.071B.033","volume":"71B","author":"J. Edmonds","year":"1967","unstructured":"J. Edmonds, \u201cSystems of distinct representatives and linear algebra\u201d,Journal of Research of the National Bureau of Standards \u2014 B 71B (1967) 241\u2013245.","journal-title":"Journal of Research of the National Bureau of Standards \u2014 B"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J. Edmonds","year":"1972","unstructured":"J. Edmonds and R.M. Karp, \u201cTheoretical improvements in algorithmic efficiency for network flow problems\u201d,Journal of the Association for Computing Machinery 19 (1972) 248\u2013264.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"CR7","volume-title":"Linear inequalities and related systems","author":"A.J. Hoffman","year":"1956","unstructured":"A.J. Hoffman and J.B. Kruskal, \u201cIntegral boundary points of convex polyhedra\u201d, in: H.W. Kuhn and A.W. Tucker, eds.,Linear inequalities and related systems (Princeton University Press, Princeton, NJ, 1956)."},{"key":"CR8","first-page":"43","volume":"21","author":"R.G. Jeroslow","year":"1979","unstructured":"R.G. Jeroslow, \u201cSome relaxation methods for linear inequalities\u201d,Cahiers du Centre d'\u00c9tudes de Recherche Op\u00e9rationnelle 21 (1979) 43\u201353.","journal-title":"Cahiers du Centre d'\u00c9tudes de Recherche Op\u00e9rationnelle"},{"key":"CR9","volume-title":"Complexity of computer computations","author":"R.M. Karp","year":"1972","unstructured":"R.M. Karp, \u201cReducibility among combinatorial problems\u201d, in: R.E. Miller, et al. eds.,Complexity of computer computations (Plenum Press, New York, 1972)."},{"key":"CR10","first-page":"191","volume":"20","author":"L.G. Khachijan","year":"1979","unstructured":"L.G. Khachijan, \u201cA polynomial algorithm in linear programming\u201d,Soviet Mathematics Doklady 20 (1979) 191\u2013194.","journal-title":"Soviet Mathematics Doklady"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0012-365X(72)90006-4","volume":"2","author":"L. Lov\u00e1sz","year":"1972","unstructured":"L. Lov\u00e1sz, \u201cNormal hypergraphs and the perfect graph conjecture\u201d,Discrete Mathematics 2 (1972) 253\u2013267.","journal-title":"Discrete Mathematics"},{"key":"CR12","unstructured":"J.F. Maurras, \u201cBon algorithmes, vieilles id\u00e9es\u201d, NoteE.d.F. HR 32.0320, 1978."},{"key":"CR13","unstructured":"J.F. Maurras, \u201cGood algorithms, old ideas\u201d, manuscript, 1978."},{"key":"CR14","doi-asserted-by":"crossref","first-page":"393","DOI":"10.4153\/CJM-1954-038-x","volume":"6","author":"T.S. Motzkin","year":"1954","unstructured":"T.S. Motzkin and I.J. Schoenberg, \u201cThe relaxation method for linear inequalities\u201d,Canadian Journal of Mathematics 6 (1954) 393\u2013404.","journal-title":"Canadian Journal of Mathematics"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0095-8956(80)90075-1","volume":"28","author":"P.D. Seymour","year":"1980","unstructured":"P.D. Seymour, \u201cDecomposition of regular matroids\u201d,Journal of Combinatorial Theory(B) 28 (1980) 305\u2013359.","journal-title":"Journal of Combinatorial Theory(B)"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1007\/BF01070506","volume":"6","author":"N.Z. Shor","year":"1970","unstructured":"N.Z. Shor, \u201cConvergence rate of the gradient descent method with dilatation of the space\u201d,Cybernetics 6 (1970) 102\u2013108.","journal-title":"Cybernetics"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1137\/1010063","volume":"10","author":"A.F. Veinott Jr.","year":"1968","unstructured":"A.F. Veinott, Jr. and G.B. Dantzig, \u201cIntegral extreme points\u201d,SIAM Review 10 (1968) 371\u2013372.","journal-title":"SIAM Review"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01584235.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01584235\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01584235","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:29:28Z","timestamp":1556897368000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01584235"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,12]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1981,12]]}},"alternative-id":["BF01584235"],"URL":"https:\/\/doi.org\/10.1007\/bf01584235","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1981,12]]}}}