{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T09:46:42Z","timestamp":1751881602737},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1993,9,1]],"date-time":"1993-09-01T00:00:00Z","timestamp":746841600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[1993,9]]},"DOI":"10.1007\/bf02023105","type":"journal-article","created":{"date-parts":[[2005,8,12]],"date-time":"2005-08-12T10:28:34Z","timestamp":1123842514000},"page":"361-391","source":"Crossref","is-referenced-by-count":9,"title":["An improved N-tree algorithm for the enumeration of all neighbors of a degenerate vertex"],"prefix":"10.1007","volume":"46-47","author":[{"given":"Ferdinand","family":"Geue","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02023105_CR1","doi-asserted-by":"crossref","unstructured":"P. Armand, Bounds on the number of vertices of perturbed polyhedra, Ann. Oper. Res. 47 (1993), this volume.","DOI":"10.1007\/BF02023098"},{"key":"BF02023105_CR2","unstructured":"P. Armand, Combinatorial behaviour of perturbed polyhedra in linear programming, C. R. Acad\u00e9mie des Sciences, to appear."},{"key":"BF02023105_CR3","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/BF00941298","volume":"70","author":"P. Armand","year":"1991","unstructured":"P. Armand and C. Malivert, Determination of the efficient set in multiobjective linear programming, J. Opt. Theory Apl. 70 (1991) 467\u2013489.","journal-title":"J. Opt. Theory Apl."},{"key":"BF02023105_CR4","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1137\/0109008","volume":"9","author":"M.L. Balinski","year":"1961","unstructured":"M.L. Balinski, An algorithm for finding all vertices of convex polyhedral sets, SIAM J. Appl Math. 9 (1961) 72\u201388.","journal-title":"SIAM J. Appl Math."},{"key":"BF02023105_CR5","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1002\/nav.3800020406","volume":"2","author":"E.M.L. Beale","year":"1955","unstructured":"E.M.L. Beale, Cycling in the dual simplex algorithm, Naval Res. Log. Quarterly 2 (1955) 269\u2013276.","journal-title":"Naval Res. Log. Quarterly"},{"key":"BF02023105_CR6","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1287\/moor.2.2.103","volume":"2","author":"R.G. Bland","year":"1977","unstructured":"R.G. Bland, New finite pivoting rules for the simplex method, Math. Oper. Res. 2 (1977) 103\u2013107.","journal-title":"Math. Oper. Res."},{"key":"BF02023105_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1148-8","volume-title":"An Introduction to Convex Polytopes","author":"A. Br\u00f8ndsted","year":"1983","unstructured":"A. Br\u00f8ndsted,An Introduction to Convex Polytopes (Springer, New York\/Heidelberg\/Berlin, 1983)."},{"key":"BF02023105_CR8","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 (1952) 160\u2013170.","journal-title":"Econometrica"},{"key":"BF02023105_CR9","doi-asserted-by":"crossref","first-page":"183","DOI":"10.2140\/pjm.1955.5.183","volume":"5","author":"G.B. Dantzig","year":"1955","unstructured":"G.B. Dantzig, A. Orden and P. Wolfe, The generalized simplex method for minimizing a linear form under linear inequality restraints, Pacific J. Math. 5 (1955) 183\u2013195.","journal-title":"Pacific J. Math."},{"key":"BF02023105_CR10","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF01593771","volume":"12","author":"M.E. Dyer","year":"1977","unstructured":"M.E. Dyer and L.G. Proll, An algorithm for determining all extreme points of a convex polytope,. Math. Prog. 12 (1977) 81\u201396.","journal-title":"Math. Prog."},{"key":"BF02023105_CR11","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0377-2217(82)90180-1","volume":"9","author":"M.E. Dyer","year":"1982","unstructured":"M.E. Dyer and L.G. Proll, An improved vertex enumeration algorithm, Eur. J. Oper. Res. 9 (1982) 359\u2013368.","journal-title":"Eur. J. Oper. Res."},{"key":"BF02023105_CR12","volume-title":"Determination of all neighbors of a degenerate extreme point in polytopes","author":"T. Gal","year":"1978","unstructured":"T. Gal, Determination of all neighbors of a degenerate extreme point in polytopes, Discussion paper Nr. 17b, Department of Economics, FernUniversit\u00e4t-Gesamthochschule, Hagen, Germany (1978)."},{"key":"BF02023105_CR13","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1007\/BF00939135","volume":"45","author":"T. Gal","year":"1985","unstructured":"T. Gal, On the structure of the set bases of a degenerate point, J. Optim. Theory Appl. 45 (1985) 577\u2013589.","journal-title":"J. Optim. Theory Appl."},{"key":"BF02023105_CR14","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/0377-2217(92)90083-L","volume":"60","author":"T. Gal","year":"1992","unstructured":"T. Gal, Weakly redundant constraints and their impact on postoptimal analyses in LP, Eur. J. Oper. Res. 60 (1992) 315\u2013326.","journal-title":"Eur. J. Oper. Res."},{"key":"BF02023105_CR15","doi-asserted-by":"crossref","unstructured":"T. Gal, Degeneracy graphs: Theory and application \u2014 An updated survey, Ann. Oper. Res. 46 (1993), this volume.","DOI":"10.1007\/BF02096258"},{"key":"BF02023105_CR16","unstructured":"T. Gal, Determining the set of all efficient solutions of an LVMP under degeneracy,Proc. 10th Int. Conf. on MCDM, Taipeh (Taiwan) (July 1992), to appear with Springer."},{"key":"BF02023105_CR17","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0167-6377(92)90058-B","volume":"11","author":"T. Gal","year":"1992","unstructured":"T. Gal and F. Geue, A new pivoting rule for solving various degeneracy problems, Oper. Res. Lett. 11 (1992) 23\u201332.","journal-title":"Oper. Res. Lett."},{"key":"BF02023105_CR18","volume-title":"Eine neue Pivotauswahlregel und die durch sie induzierten Teilgraphen des positiven Entartungsgraphen","author":"F. Geue","year":"1989","unstructured":"F. Geue, Eine neue Pivotauswahlregel und die durch sie induzierten Teilgraphen des positiven Entartungsgraphen, Discussion paper Nr. 141, Department of Economics, FernUniversit\u00e4t \u2014 Gesamthochschule, Hagen, Germany (1989)."},{"key":"BF02023105_CR19","volume-title":"Eckenabsuchende Verfahren unter Entartung: Theorie, Algorithmen und Vergleichstests","author":"F. Geue","year":"1992","unstructured":"F. Geue, Eckenabsuchende Verfahren unter Entartung: Theorie, Algorithmen und Vergleichstests, Dissertation, Fernuniversit\u00e4t \u2014 Gesamthochschule, Hagen, Germany (1992)."},{"key":"BF02023105_CR20","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M.C. Golumbic","year":"1980","unstructured":"M.C. Golumbic,Algorithmic Graph Theory and Perfect Graphs (Academic Press, New York, 1980)."},{"key":"BF02023105_CR21","volume-title":"Graphes et Algorithmes","author":"M. Gondran","year":"1979","unstructured":"M. Gondran and M. Minoux,Graphes et Algorithmes (Editions Eyrolles, Paris, 1979)."},{"key":"BF02023105_CR22","volume-title":"Linear Programming","author":"G. Hadley","year":"1974","unstructured":"G. Hadley,Linear Programming (Addison-Wesley, Reading, 1974)."},{"key":"BF02023105_CR23","unstructured":"A.J. Hoffmann, Cycling in the simplex algorithm, National Bureau of Standards Report 2974."},{"key":"BF02023105_CR24","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-45535-3","volume-title":"Redundancy in Mathematical Programming","author":"M.H. Karwan","year":"1983","unstructured":"M.H. Karwan, V. Lotfi, J. Telgen and St. Zionts,Redundancy in Mathematical Programming (Springer, Berlin\/Heidelberg\/New York\/Tokyo, 1983)."},{"key":"BF02023105_CR25","series-title":"Lecture Notes in Economics and Mathematical Systems","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-49270-9","volume-title":"Degeneracy Graphs and the Neighbourhood Problem","author":"H.-J. Kruse","year":"1986","unstructured":"H.-J. Kruse,Degeneracy Graphs and the Neighbourhood Problem, Lecture Notes in Economics and Mathematical Systems 260 (Springer, Berlin\/Heidelberg\/New York\/Tokyo, 1986)."},{"key":"BF02023105_CR26","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1002\/nav.3800160110","volume":"16","author":"K.T. Marshall","year":"1969","unstructured":"K.T. Marshall and J.W. Suurballe, A note on cycling in the simplex method, Naval Res. Log. Quarterly 16 (1969) 121\u2013137.","journal-title":"Naval Res. Log. Quarterly"},{"key":"BF02023105_CR27","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1287\/opre.21.1.247","volume":"21","author":"T.H. Mattheiss","year":"1973","unstructured":"T.H. Mattheiss, An algorithm for determining irrelevant constraints and all vertices in systems of linear inequalities, Oper. Res. 21 (1973) 247\u2013260.","journal-title":"Oper. Res."},{"key":"BF02023105_CR28","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1287\/moor.2.3.292","volume":"2","author":"B.K. Schmidt","year":"1977","unstructured":"B.K. Schmidt and T.H. Mattheiss, The probability that a random polytope is bounded, Math. Oper. Res. 2 (1977) 292\u2013296.","journal-title":"Math. Oper. Res."},{"key":"BF02023105_CR29","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1007\/BF01935004","volume":"25","author":"S.W. Wallace","year":"1985","unstructured":"S.W. Wallace, Pivoting rules and redundancy schemes in extreme point enumeration, BIT 25 (1985) 274\u2013280.","journal-title":"BIT"},{"key":"BF02023105_CR30","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1137\/0111016","volume":"11","author":"P. Wolfe","year":"1963","unstructured":"P. Wolfe, A technique for resolving degeneracy in linear programming, SIAM J. Appl. Math. 11 (1963) 305\u2013311.","journal-title":"SIAM J. Appl. Math."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02023105.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02023105\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02023105","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T22:39:58Z","timestamp":1557787198000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02023105"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,9]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,9]]}},"alternative-id":["BF02023105"],"URL":"https:\/\/doi.org\/10.1007\/bf02023105","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,9]]}}}