{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:22:49Z","timestamp":1750306969307,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,9,19]],"date-time":"2013-09-19T00:00:00Z","timestamp":1379548800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,9,19]]},"DOI":"10.1145\/2491845.2491856","type":"proceedings-article","created":{"date-parts":[[2013,9,3]],"date-time":"2013-09-03T11:57:17Z","timestamp":1378209437000},"page":"174-179","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Combining interior and exterior simplex type algorithms"],"prefix":"10.1145","author":[{"given":"Themistoklis","family":"Glavelis","sequence":"first","affiliation":[{"name":"University of Macedonia, Thessaloniki, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikolaos","family":"Ploskas","sequence":"additional","affiliation":[{"name":"University of Macedonia, Thessaloniki, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikolaos","family":"Samaras","sequence":"additional","affiliation":[{"name":"University of Macedonia, Thessaloniki, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,9,19]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"157","article-title":"The average number of pivot steps required by the simplex method is polynomial","volume":"26","author":"Borgwardt H. K.","year":"1982","unstructured":"Borgwardt , H. K. 1982 . The average number of pivot steps required by the simplex method is polynomial . Zeitschrift fur Operational Research 26 , 1, 157 -- 177 . DOI= http:\/\/dx.doi.org\/10.1007%2FBF01917108. Borgwardt, H. K. 1982. The average number of pivot steps required by the simplex method is polynomial. Zeitschrift fur Operational Research 26, 1, 157--177. DOI= http:\/\/dx.doi.org\/10.1007%2FBF01917108.","journal-title":"Zeitschrift fur Operational Research"},{"key":"#cr-split#-e_1_3_2_1_2_1.1","doi-asserted-by":"crossref","unstructured":"Bazaraa M. S. Jarvis J. J. and Sherali H. D. 2005. Linear Programming and Network Flows 3rd ed.. John Wiley & Sons. DOI= http:\/\/dx.doi.org\/10.1002\/9780471703778. 10.1002\/9780471703778","DOI":"10.1002\/9780471703778"},{"key":"#cr-split#-e_1_3_2_1_2_1.2","doi-asserted-by":"crossref","unstructured":"Bazaraa M. S. Jarvis J. J. and Sherali H. D. 2005. Linear Programming and Network Flows 3rd ed.. John Wiley & Sons. DOI= http:\/\/dx.doi.org\/10.1002\/9780471703778.","DOI":"10.1002\/9780471703778"},{"key":"e_1_3_2_1_3_1","unstructured":"Bertsimas D. and Tsitsiklis J. N. 1997. Introduction to Linear Optimization. Athena Scientific.   Bertsimas D. and Tsitsiklis J. N. 1997. Introduction to Linear Optimization . Athena Scientific."},{"volume-title":"Linear Programming and Extensions","author":"Dantzig G. B.","key":"e_1_3_2_1_4_1","unstructured":"Dantzig , G. B. 1963. Linear Programming and Extensions . Princeton, University Press , Princeton, NJ . Dantzig, G. B. 1963. Linear Programming and Extensions. Princeton, University Press, Princeton, NJ."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.42.12.1719"},{"key":"#cr-split#-e_1_3_2_1_6_1.1","doi-asserted-by":"crossref","unstructured":"Glavelis Th. and Samaras N. 2013. An experimental investigation of a primal-dual exterior point simplex algorithm. Optimization - A Journal of Mathematical Programming and Operations Research 1--10. DOI= http:\/\/dx.doi.org\/10.1080\/02331934.2013.765422 10.1080\/02331934.2013.765422","DOI":"10.1080\/02331934.2013.765422"},{"key":"#cr-split#-e_1_3_2_1_6_1.2","doi-asserted-by":"crossref","unstructured":"Glavelis Th. and Samaras N. 2013. An experimental investigation of a primal-dual exterior point simplex algorithm. Optimization - A Journal of Mathematical Programming and Operations Research 1--10. DOI= http:\/\/dx.doi.org\/10.1080\/02331934.2013.765422","DOI":"10.1080\/02331934.2013.765422"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00249643"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579150"},{"key":"e_1_3_2_1_9_1","unstructured":"Klee V. and Minty G. J. 1992. How good is the simplex algorithm?. Inequalities III. New York: Academic Press 159--175.  Klee V. and Minty G. J. 1992. How good is the simplex algorithm? . Inequalities III. New York: Academic Press 159--175."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01586925"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(02)00077-1"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(02)00400-9"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02096264"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1080\/10556789808805699"}],"event":{"name":"PCI 2013: 17th Panhellenic Conference on Informatics","sponsor":["University of Macedonia","Aristotle University of Thessaloniki","The University of Sheffield The University of Sheffield","Alexander TEI of Thessaloniki"],"location":"Thessaloniki Greece","acronym":"PCI 2013"},"container-title":["Proceedings of the 17th Panhellenic Conference on Informatics"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2491845.2491856","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2491845.2491856","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:23Z","timestamp":1750235963000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2491845.2491856"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,19]]},"references-count":16,"alternative-id":["10.1145\/2491845.2491856","10.1145\/2491845"],"URL":"https:\/\/doi.org\/10.1145\/2491845.2491856","relation":{},"subject":[],"published":{"date-parts":[[2013,9,19]]},"assertion":[{"value":"2013-09-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}