{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T05:17:05Z","timestamp":1735622225023,"version":"3.32.0"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[1980,12,1]],"date-time":"1980-12-01T00:00:00Z","timestamp":344476800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["International Journal of Computer and Information Sciences"],"published-print":{"date-parts":[[1980,12]]},"DOI":"10.1007\/bf01417939","type":"journal-article","created":{"date-parts":[[2005,4,3]],"date-time":"2005-04-03T14:47:24Z","timestamp":1112539644000},"page":"483-506","source":"Crossref","is-referenced-by-count":4,"title":["Complexity and computability of solutions to linear programming systems"],"prefix":"10.1007","volume":"9","author":[{"given":"A.","family":"Charnes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W. W.","family":"Cooper","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Duffuaa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Kress","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0166-218X(79)90011-8","volume":"1","author":"R. Armstrong","year":"1979","unstructured":"R. Armstrong, A. Charnes, and F. Phillips, ?Page cuts for integer interval linear programming,?Discrete Appl. Math. 1:1?14 (1979).","journal-title":"Discrete Appl. Math."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"578","DOI":"10.1287\/mnsc.10.3.578","volume":"10","author":"M. L. Balinski","year":"1964","unstructured":"M. L. Balinski and R. E. Gomory, ?A primal method for the assignment and transportation problems,?Manage. Sci. 10:578?594 (1964).","journal-title":"Manage. Sci."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"1166","DOI":"10.1287\/opre.16.6.1166","volume":"16","author":"A. Ben-Israel","year":"1968","unstructured":"A. Ben-Israel and A. Charnes, ?An explicit solution of a class of linear programming problems,?Oper. Res. 16:1166?1175 (1968).","journal-title":"Oper. Res."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"160","DOI":"10.2307\/1907845","volume":"20","author":"A. Charnes","year":"1952","unstructured":"A. Charnes, ?Optimality and degeneracy in linear programming,?Econometrica 20:160?170 (1952).","journal-title":"Econometrica"},{"key":"CR5","volume-title":"Management Models and Industrial Applications of Linear Programming, Vol. I and II","author":"A. Charnes","year":"1961","unstructured":"A. Charnes and W. W. Cooper,Management Models and Industrial Applications of Linear Programming, Vol. I and II (Wiley, New York, 1961)."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0024-3795(77)90042-8","volume":"17","author":"A. Charnes","year":"1977","unstructured":"A. Charnes, D. Granot, and F. Granot, ?A primal algorithm for interval linear programming problems,?Linear Algebra and Its Appl. 17:65?78 (1977).","journal-title":"Linear Algebra and Its Appl."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"688","DOI":"10.1287\/opre.25.4.688","volume":"25","author":"A. Charnes","year":"1977","unstructured":"A. Charnes, F. Granot, and F. Phillips, ?An algorithm for solving interval linear programming problems,?Oper. Res. 25:688?695 (July?August 1977).","journal-title":"Oper. Res."},{"key":"CR8","unstructured":"A. Charnes and K. Kortanek, ?An Opposite Sign Algorithm for ?Purification? to an Extreme Point Solution,? ONR Research Report No. 84, Systems Research Group, Northwestern University (June 1963)."},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"A. Charnes and C. E. Lemke, ?A modified simplex method for control of roundoff error in linear programming,?Proceedings of the ACM, Pittsburgh (May 2?3, 1952), pp. 97?98.","DOI":"10.1145\/609784.609794"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1287\/opre.10.5.711","volume":"10","author":"A. Charnes","year":"1962","unstructured":"A. Charnes, W. W. Cooper, and G. Thompson, ?Some properties of redundant constraints and extraneous variables in direct and dual linear programming problems,?Oper. Res. 10:711?723 (1962).","journal-title":"Oper. Res."},{"key":"CR11","unstructured":"A. Charnes, K. Kortanek, and W. Raike, ?Extreme Point Solutions in Mathematical Programming: An Opposite Sign Algorithm,? Systems Research Memorandum No. 129, Systems Research Group, Northwestern University (June 1963)."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0305-0548(75)90010-6","volume":"2","author":"A. Charnes","year":"1975","unstructured":"A. Charnes, D. Karney, D. Klingman, and J. Stutz, ?Past, present and future of large scale transshipment computer codes and applications,?Comprs. and Oper. Res. J. 2:71?81 (1975).","journal-title":"Comprs. and Oper. Res. J."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1007\/978-3-642-46414-0_18","volume-title":"Extremal Methods and Systems Analysis","author":"U. Eckhardt","year":"1980","unstructured":"U. Eckhardt, ?Representation of convex sets,? inExtremal Methods and Systems Analysis, A. V. Fiacco and K. O. Kortanek, Eds. (Springer-Verlag, Berlin, 1980), pp. 374?384."},{"key":"CR14","unstructured":"P. Gacs and L. Lovasz, ?Khachian's Algorithm for Linear Programming,? Working Paper, Computer Science Department, Stanford University (Fall 1979)."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF01580225","volume":"6","author":"R. Jeroslow","year":"1974","unstructured":"R. Jeroslow, ?Trivial integer programs unsolvable by branch and bound,?Math. Programming 6:105?109 (1974).","journal-title":"Math. Programming"},{"key":"CR16","first-page":"191","volume":"20","author":"L. G. Khachian","year":"1979","unstructured":"L. G. Khachian, ?A polynomial algorithm in linear programming,?Soviet Math. Doklady 20:191?194 (1979).","journal-title":"Soviet Math. Doklady"},{"key":"CR17","first-page":"159","volume-title":"Inequalities III","author":"V. Klee","year":"1971","unstructured":"V. Klee and G. J. Minty, ?How good is the simplex algorithm?? inInequalities III, O. Shisha, Ed., (Academic Press, New York, 1971), pp. 159?175."},{"key":"CR18","first-page":"143","volume":"32","author":"B. Korte","year":"1979","unstructured":"B. Korte, D. Hausmann, and R. Kannan, ?Exponentielle untere Komplexit\ufffdtsschranken f\ufffdr eine Klasse von Knapsackproblemen,?Oper. Res. Verfahren 32:143?147 (1979).","journal-title":"Oper. Res. Verfahren"},{"key":"CR19","unstructured":"A. Yu. Levin, ?An algorithm for the minimization of convex functions,?Dokl. Akad. Nauk SSSR 160(6) (1965)."},{"key":"CR20","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/0024-3795(70)90008-X","volume":"3","author":"P. D. Roberts","year":"1970","unstructured":"P. D. Roberts and A. Ben-Israel, ?A suboptimization method for interval linear programming: A new method for linear programming,?Linear Algebra and Its Appl. 3:383?405 (1970).","journal-title":"Linear Algebra and Its Appl."},{"key":"CR21","unstructured":"N. Z. Shor, ?On the rate of convergence of the generalized gradient methods,?Kibernetika, No. 3 (1968)."},{"key":"CR22","first-page":"6","volume":"No. 1","author":"N. Z. Shor","year":"1970","unstructured":"N. Z. Shor, ?The use of the operation of space dilatation in the minimization of convex functions,?Kibernetika, No. 1, 6?12 (1970).","journal-title":"Kibernetika"},{"key":"CR23","unstructured":"N. Z. Shor, ?Generalized gradient methods for the minimization of nonsmooth functions and the application in mathematical programming? (survey),Ekonom. Mat. Metody 12(2) (1976)."},{"key":"CR24","first-page":"94","volume":"No. 1","author":"N. Z. Shor","year":"1977","unstructured":"N. Z. Shor, ?Cut-off Method with space extension in convex programming problems,?Kibernetika, No. 1, 94?95 (Jan.?Feb. 1977).","journal-title":"Kibernetika"},{"key":"CR25","unstructured":"N. Z. Shor and V. I. Biletskii, ?The method of space dilatation to accelerate convergence in gully-type problems,?Optimal Decision Theory 2 (1969) (Kiev)."}],"container-title":["International Journal of Computer & Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01417939.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01417939\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01417939","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,30]],"date-time":"2024-12-30T18:14:49Z","timestamp":1735582489000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01417939"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,12]]},"references-count":25,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1980,12]]}},"alternative-id":["BF01417939"],"URL":"https:\/\/doi.org\/10.1007\/bf01417939","relation":{},"ISSN":["0091-7036","1573-7640"],"issn-type":[{"type":"print","value":"0091-7036"},{"type":"electronic","value":"1573-7640"}],"subject":[],"published":{"date-parts":[[1980,12]]}}}