{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:41:21Z","timestamp":1740109281738,"version":"3.37.3"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2018,12,3]],"date-time":"2018-12-03T00:00:00Z","timestamp":1543795200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["711\/09","286\/13"],"award-info":[{"award-number":["711\/09","286\/13"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1007\/s10107-018-1353-6","type":"journal-article","created":{"date-parts":[[2018,12,2]],"date-time":"2018-12-02T20:21:51Z","timestamp":1543782111000},"page":"157-201","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A simplex-type algorithm for continuous linear programs with constant coefficients"],"prefix":"10.1007","volume":"180","author":[{"given":"Evgeny","family":"Shindin","sequence":"first","affiliation":[]},{"given":"Gideon","family":"Weiss","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,12,3]]},"reference":[{"key":"1353_CR1","doi-asserted-by":"publisher","first-page":"1469","DOI":"10.1080\/00207728108963831","volume":"12","author":"EJ Anderson","year":"1981","unstructured":"Anderson, E.J.: A new continuous model for job-shop scheduling. Int. J. Syst. Sci. 12, 1469\u20131475 (1981)","journal-title":"Int. J. Syst. Sci."},{"key":"1353_CR2","volume-title":"Linear Programming in Infinite Dimensional Spaces","author":"EJ Anderson","year":"1987","unstructured":"Anderson, E.J., Nash, P.: Linear Programming in Infinite Dimensional Spaces. Wiley-Interscience, Chichester (1987)"},{"key":"1353_CR3","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1002\/net.3230190403","volume":"19","author":"EJ Anderson","year":"1989","unstructured":"Anderson, E.J., Philpott, A.B.: A continuous time network simplex algorithm. Networks 19, 395\u2013425 (1989)","journal-title":"Networks"},{"issue":"2","key":"1353_CR4","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1137\/110822992","volume":"22","author":"D Bampou","year":"2012","unstructured":"Bampou, D., Kuhn, D.: Polynomial approximations for continuous linear programs. SIAM J. Optim. 22(2), 628\u2013648 (2012)","journal-title":"SIAM J. Optim."},{"key":"1353_CR5","doi-asserted-by":"publisher","first-page":"947","DOI":"10.1073\/pnas.39.9.947","volume":"39","author":"R Bellman","year":"1953","unstructured":"Bellman, R.: Bottleneck problems and dynamic programming. Proc. Natl. Acad. Sci. 39, 947\u2013951 (1953)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"1353_CR6","volume-title":"The Linear Complementarity Problem","author":"RW Cottle","year":"1992","unstructured":"Cottle, R.W., Pang, J.S., Stone, R.E.: The Linear Complementarity Problem. AP, New York (1992)"},{"key":"1353_CR7","unstructured":"Dantzig, G.B.: Application of the simplex method to a transportation problem. In: Koopmans, T. (ed.) Activity Analysis of Production and Allocation, pp. 359\u2013373, 330\u2013335. Wiley, New York (1951)"},{"issue":"1","key":"1353_CR8","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1287\/opre.8.1.101","volume":"8","author":"GB Dantzig","year":"1960","unstructured":"Dantzig, G.B., Wolfe, P.: Decomposition principle for linear programs. Oper. Res. 8(1), 101\u2013111 (1960)","journal-title":"Oper. Res."},{"issue":"4","key":"1353_CR9","doi-asserted-by":"publisher","first-page":"916","DOI":"10.1287\/moor.1050.0166","volume":"30","author":"L Fleischer","year":"2005","unstructured":"Fleischer, L., Sethuraman, J.: Efficient algorithms for separated continuous linear programs: the multicommodity flow problem with holding costs and extensions. Math. Oper. Res. 30(4), 916\u2013938 (2005)","journal-title":"Math. Oper. Res."},{"issue":"6","key":"1353_CR10","doi-asserted-by":"publisher","first-page":"1600","DOI":"10.1137\/S0097539703427215","volume":"36","author":"L Fleischer","year":"2007","unstructured":"Fleischer, L., Skutella, M.: Quickest flows over time. SIAM J. Comput. 36(6), 1600\u20131630 (2007)","journal-title":"SIAM J. Comput."},{"issue":"3\u20135","key":"1353_CR11","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/S0167-6377(98)00037-6","volume":"23","author":"L Fleischer","year":"1998","unstructured":"Fleischer, L., Tardos, F.: Efficient continuous-time dynamic network flow algorithms. Oper. Res. Lett. 23(3\u20135), 71\u201380 (1998)","journal-title":"Oper. Res. Lett."},{"key":"1353_CR12","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1137\/0118011","volume":"18","author":"RC Grinold","year":"1970","unstructured":"Grinold, R.C.: Symmetric duality for continuous linear programs. SIAM J. Appl. Math. 18, 32\u201351 (1970)","journal-title":"SIAM J. Appl. Math."},{"issue":"1","key":"1353_CR13","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1287\/moor.25.1.36.15211","volume":"25","author":"B Hoppe","year":"2000","unstructured":"Hoppe, B., Tardos, F.: The quickest transshipment problem. Math. Oper. Res. 25(1), 36\u201362 (2000)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"1353_CR14","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1287\/mnsc.8.4.442","volume":"8","author":"CE Lemke","year":"1962","unstructured":"Lemke, C.E.: A method of solution for quadratic programs. Manage. Sci. 8(4), 442\u2013453 (1962)","journal-title":"Manage. Sci."},{"issue":"7","key":"1353_CR15","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1287\/mnsc.11.7.681","volume":"11","author":"CE Lemke","year":"1965","unstructured":"Lemke, C.E.: Bimatrix equilibrium points and mathematical programming. Manage. Sci. 11(7), 681\u2013689 (1965)","journal-title":"Manage. Sci."},{"issue":"2","key":"1353_CR16","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1137\/0112033","volume":"12","author":"CE Lemke","year":"1964","unstructured":"Lemke, C.E., Howson Jr., J.T.: Equilibrium points of bimatrix games. SIAM J. Appl. Math. 12(2), 413\u2013423 (1964)","journal-title":"SIAM J. Appl. Math."},{"key":"1353_CR17","doi-asserted-by":"crossref","unstructured":"Leontief, W. (ed.).: Input\u2013Output Economics. Oxford University Press (1986)","DOI":"10.1057\/978-1-349-95121-5_1072-1"},{"key":"1353_CR18","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0022-247X(66)90187-9","volume":"16","author":"N Levinson","year":"1966","unstructured":"Levinson, N.: A class of continuous linear programming problems. J. Math. Anal. Appl. 16, 73\u201383 (1966)","journal-title":"J. Math. Anal. Appl."},{"issue":"1","key":"1353_CR19","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/S0363012995292664","volume":"37","author":"X Luo","year":"1998","unstructured":"Luo, X., Bertsimas, D.: A new algorithm for state-constrained separated continuous linear programs. SIAM J. Control Optim. 37(1), 177\u2013210 (1998)","journal-title":"SIAM J. Control Optim."},{"issue":"1","key":"1353_CR20","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s10479-008-0443-x","volume":"170","author":"Y Nazarathy","year":"2009","unstructured":"Nazarathy, Y., Weiss, G.: Near optimal control of queueing networks over a finite time horizon. Ann. Oper. Res. 170(1), 233 (2009)","journal-title":"Ann. Oper. Res."},{"key":"1353_CR21","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/0022-247X(82)90163-9","volume":"87","author":"NS Papageorgiou","year":"1982","unstructured":"Papageorgiou, N.S.: A class of infinite dimensional linear programming problems. J. Math. Anal. Appl. 87, 228\u2013245 (1982)","journal-title":"J. Math. Anal. Appl."},{"key":"1353_CR22","doi-asserted-by":"publisher","first-page":"1558","DOI":"10.1137\/0331073","volume":"31","author":"MC Pullan","year":"1993","unstructured":"Pullan, M.C.: An algorithm for a class of continuous linear programs. SIAM J. Control Optim. 31, 1558\u20131577 (1993)","journal-title":"SIAM J. Control Optim."},{"key":"1353_CR23","doi-asserted-by":"publisher","first-page":"1952","DOI":"10.1137\/S0363012993247858","volume":"33","author":"MC Pullan","year":"1995","unstructured":"Pullan, M.C.: Forms of optimal solutions for separated continuous linear programs. SIAM J. Control Optim. 33, 1952\u20131977 (1995)","journal-title":"SIAM J. Control Optim."},{"key":"1353_CR24","doi-asserted-by":"publisher","first-page":"931","DOI":"10.1137\/S0363012993257507","volume":"34","author":"MC Pullan","year":"1996","unstructured":"Pullan, M.C.: A duality theory for separated continuous linear programs. SIAM J. Control Optim. 34, 931\u2013965 (1996)","journal-title":"SIAM J. Control Optim."},{"key":"1353_CR25","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1080\/13873959708837058","volume":"3","author":"MC Pullan","year":"1997","unstructured":"Pullan, M.C.: Existence and duality theory for separated continuous linear programs. Math. Model. Syst. 3, 219\u2013245 (1997)","journal-title":"Math. Model. Syst."},{"key":"1353_CR26","doi-asserted-by":"publisher","first-page":"722","DOI":"10.1137\/S1052623494278827","volume":"10","author":"MC Pullan","year":"2000","unstructured":"Pullan, M.C.: Convergence of a general class of algorithms for separated continuous linear programs. SIAM J. Control Optim. 10, 722\u2013731 (2000)","journal-title":"SIAM J. Control Optim."},{"key":"1353_CR27","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-1-4757-3403-4_7","volume-title":"Semi-Infinite Programming, Chap. 7","author":"A Shapiro","year":"2001","unstructured":"Shapiro, A.: On duality theory of conic linear problems. In: Goberna, M.A., Lopez, M.A. (eds.) Semi-Infinite Programming, Chap. 7, pp. 135\u2013165. Kluwer, Netherlands (2001)"},{"key":"1353_CR28","unstructured":"Shindin, E.: Symmetric Strong Duality and Simplex Type Algorithm for Continuous Linear Programs with Constant Coefficients. Ph.D. thesis, University of Haifa, Israel (2016)"},{"key":"1353_CR29","doi-asserted-by":"publisher","first-page":"1102","DOI":"10.1137\/130921532","volume":"24","author":"E Shindin","year":"2014","unstructured":"Shindin, E., Weiss, G.: Symmetric strong duality for a class of continuous linear programs with constant coefficients. SIAM J. Optim. 24, 1102\u20131121 (2014)","journal-title":"SIAM J. Optim."},{"key":"1353_CR30","doi-asserted-by":"publisher","first-page":"1276","DOI":"10.1137\/140971725","volume":"25","author":"E Shindin","year":"2015","unstructured":"Shindin, E., Weiss, G.: Structure of solutions for continuous linear programs with constant coefficients. SIAM J. Optim. 25, 1276\u20131297 (2015)","journal-title":"SIAM J. Optim."},{"key":"1353_CR31","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1137\/0113043","volume":"13","author":"WF Tyndall","year":"1965","unstructured":"Tyndall, W.F.: A duality theorem for a class of continuous linear programming problems. SIAM J. Appl. Math. 13, 644\u2013666 (1965)","journal-title":"SIAM J. Appl. Math."},{"key":"1353_CR32","doi-asserted-by":"publisher","first-page":"1294","DOI":"10.1137\/0115112","volume":"15","author":"WF Tyndall","year":"1967","unstructured":"Tyndall, W.F.: An extended duality theorem for continuous linear programming problems. SIAM J. Appl. Math. 15, 1294\u20131298 (1967)","journal-title":"SIAM J. Appl. Math."},{"key":"1353_CR33","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-7630-6","volume-title":"Linear Programming, Foundations and Extensions","author":"RJ Vanderbei","year":"2014","unstructured":"Vanderbei, R.J.: Linear Programming, Foundations and Extensions, 4th edn. Springer, New York (2014)","edition":"4"},{"key":"1353_CR34","doi-asserted-by":"publisher","first-page":"2118","DOI":"10.1137\/060650532","volume":"48","author":"X Wang","year":"2009","unstructured":"Wang, X., Zhang, S., Yao, D.: Separated continuous conic programming: strong duality and an approximation algorithm. SIAM J. Control Optim. 48, 2118\u20132138 (2009)","journal-title":"SIAM J. Control Optim."},{"key":"1353_CR35","doi-asserted-by":"crossref","unstructured":"Weiss, G.: A simplex based algorithm to solve separated continuous linear programs. Mathematical Programming Series A, pp. 151\u2013198 (2008)","DOI":"10.1007\/s10107-008-0217-x"},{"issue":"2","key":"1353_CR36","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s10957-012-0163-x","volume":"157","author":"CF Wen","year":"2013","unstructured":"Wen, C.F.: Continuous-time generalized fractional programming problems. Part I: basic theory. J. Optim. Theory Appl. 157(2), 365\u2013399 (2013)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"1353_CR37","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1007\/s10957-012-0131-5","volume":"156","author":"CF Wen","year":"2013","unstructured":"Wen, C.F.: Continuous-time generalized fractional programming problems, Part II: an interval-type computational procedure. J. Optim. Theory Appl. 156(3), 819\u2013843 (2013)","journal-title":"J. Optim. Theory Appl."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-018-1353-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-018-1353-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-018-1353-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,11]],"date-time":"2020-02-11T05:18:27Z","timestamp":1581398307000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-018-1353-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,3]]},"references-count":37,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["1353"],"URL":"https:\/\/doi.org\/10.1007\/s10107-018-1353-6","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"type":"print","value":"0025-5610"},{"type":"electronic","value":"1436-4646"}],"subject":[],"published":{"date-parts":[[2018,12,3]]},"assertion":[{"value":"14 May 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 November 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 December 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}