{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:53:13Z","timestamp":1742917993065,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":17,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387747583"},{"type":"electronic","value":"9780387747590"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-74759-0_509","type":"book-chapter","created":{"date-parts":[[2008,8,25]],"date-time":"2008-08-25T11:10:50Z","timestamp":1219662650000},"page":"2965-2969","source":"Crossref","is-referenced-by-count":2,"title":["Pivoting Algorithms for Linear Programming Generating Two Paths"],"prefix":"10.1007","author":[{"given":"Konstantinos","family":"Paparrizos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikolaos","family":"Samaras","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Konstantinos","family":"Tsiplidis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"509_CR1_509","first-page":"1","volume":"4","author":"H. Achatz","year":"1991","unstructured":"Achatz H, Kleinschmidt P, Paparrizos K (1991) A\u00a0dual forest algorithm for the assignment problem. DIMACS 4:1\u201310","journal-title":"DIMACS"},{"key":"509_CR2_509","unstructured":"Alexouda G, Paparrizos K (1997) A\u00a0comparative computational study with an exterior point simplex algorithm. Presented at 4th Balkan Conf"},{"key":"509_CR3_509","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1287\/opre.42.3.556","volume":"42","author":"K. Anstreicher","year":"1994","unstructured":"Anstreicher K, Terlaky T (1994) A\u00a0monotonic build-up simplex algorithm for linear programming. Oper Res 42:556\u2013561","journal-title":"Oper. Res."},{"key":"509_CR4_509","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1287\/moor.2.2.103","volume":"2","author":"R.G. Bland","year":"1977","unstructured":"Bland RG (1977) New finite pivoting rules for the simplex method. Math Oper Res 2:103\u2013107","journal-title":"Math. Oper. Res."},{"key":"509_CR5_509","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0167-6377(94)90023-X","volume":"16","author":"H. Chen","year":"1994","unstructured":"Chen H, Pardalos PM, Saunders M (1994) The simplex algorithm with a\u00a0new primal and dual pivot rule. Oper Res Lett 16:121\u2013127","journal-title":"Oper. Res. Lett."},{"key":"509_CR6_509","volume-title":"Linear programming and extensions","author":"G.B. Dantzig","year":"1967","unstructured":"Dantzig GB (1967) Linear programming and extensions. Princeton University Press, Princeton"},{"key":"509_CR7_509","first-page":"137","volume":"4","author":"K. Dosios","year":"1994","unstructured":"Dosios K, Paparrizos K (1994) A\u00a0new exterior point algorithm for linear programming problems. YJOR 4:137\u2013148","journal-title":"YJOR"},{"key":"509_CR8_509","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/S0167-6377(96)00008-9","volume":"20","author":"K. Dosios","year":"1997","unstructured":"Dosios K, Paparrizos K (1997) Resolution of the problem of degeneracy in a\u00a0primal and dual simplex algorithm. Oper Res Lett 20:45\u201350","journal-title":"Oper. Res. Lett."},{"key":"509_CR9_509","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N.K. Karmarkar","year":"1984","unstructured":"Karmarkar NK (1984) A\u00a0polynomial-time algorithm for linear programming. Combinatorica 4:373\u2013395","journal-title":"Combinatorica"},{"key":"509_CR10_509","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1051\/ro\/1988220302691","volume":"22","author":"K. Paparrizos","year":"1988","unstructured":"Paparrizos K (1988) A\u00a0non-dual signature method for the assignment problem and a\u00a0generalization of the dual simplex method for the transportation problem. RAIRO Oper Res 22:269\u2013289","journal-title":"RAIRO Oper. Res."},{"key":"509_CR11_509","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/BF01586925","volume":"51","author":"K. Paparrizos","year":"1991","unstructured":"Paparrizos K (1991) An infeasible (exterior point) simplex algorithm for assignment problems. Math Program 51:45\u201354","journal-title":"Math. Program."},{"key":"509_CR12_509","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/BF02023111","volume":"32","author":"K. Paparrizos","year":"1993","unstructured":"Paparrizos K (1993) An exterior point simplex algorithm for general linear problems. Ann Oper Res 32:497\u2013508","journal-title":"Ann. Oper. Res."},{"key":"509_CR13_509","unstructured":"Paparrizos K (1996) Exterior point simplex algorithm: Simple and short proof of correctness. In: Proc SYMOPIS'96, pp\u00a013\u201318"},{"key":"509_CR14_509","unstructured":"Paparrizos K (1996) A\u00a0new primal and dual pivoting rule for the simplex algorithm. In: Proc SYMOPIS'96, pp\u00a0448\u2013453"},{"key":"509_CR15_509","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1051\/ro\/1996300100011","volume":"30","author":"K. Paparrizos","year":"1996","unstructured":"Paparrizos K (1996) A\u00a0non improving simplex algorithm for transportation problems. RAIRO Oper Res 30:1\u201315","journal-title":"RAIRO Oper. Res."},{"key":"509_CR16_509","unstructured":"Samaras N (1998) Computational improvements and efficient implementation of two path pivoting algorithms. PhD Diss (in progress)"},{"key":"509_CR17_509","unstructured":"Tsiplidis K (1998) Efficient variants of an exterior point pivoting algorithm. PhD Diss (in progress)"}],"container-title":["Encyclopedia of Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-74759-0_509","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T10:17:31Z","timestamp":1720693051000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-74759-0_509"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387747583","9780387747590"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-74759-0_509","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}