{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T06:05:40Z","timestamp":1747548340679},"reference-count":123,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1993,3,1]],"date-time":"1993-03-01T00:00:00Z","timestamp":730944000000},"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,3]]},"DOI":"10.1007\/bf02096255","type":"journal-article","created":{"date-parts":[[2005,9,12]],"date-time":"2005-09-12T18:23:22Z","timestamp":1126549402000},"page":"1-7","source":"Crossref","is-referenced-by-count":10,"title":["Selected bibliography on degeneracy"],"prefix":"10.1007","volume":"46-47","author":[{"given":"Tomas","family":"Gal","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02096255_CR1","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BF02253740","volume":"38","author":"P. Abel","year":"1987","unstructured":"P. Abel, On the choice of the pivot columns of the simplex method: gradient criteria, Computing 38 (1987) 13\u201321.","journal-title":"Computing"},{"key":"BF02096255_CR2","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1287\/moor.11.4.570","volume":"11","author":"I. Adler","year":"1986","unstructured":"I. Adler, R. Karp and R. Shamir, A family of simplex variants solving anm \u00d7 d linear program in expected number of pivot steps depending ond only, Math. Oper. Res. 11 (1986) 570\u2013590.","journal-title":"Math. Oper. Res."},{"key":"BF02096255_CR3","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/BF01580452","volume":"8","author":"J.H. Ahrens","year":"1975","unstructured":"J.H. Ahrens and G. Finke, Degeneracy in fixed cost transportation problems, Math. Progr. 8 (1975) 369\u2013374.","journal-title":"Math. Progr."},{"key":"BF02096255_CR4","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0167-6377(85)90017-3","volume":"4","author":"R.K. Ahuja","year":"1985","unstructured":"R.K. Ahuja, Minimax linear programming problem, Oper. Res. Lett. 4 (1985) 131\u2013134.","journal-title":"Oper. Res. Lett."},{"key":"BF02096255_CR5","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1057\/jors.1984.83","volume":"35","author":"M. Akg\u00fcl","year":"1984","unstructured":"M. Akg\u00fcl, A note on shadow prices in linear programming, J. Oper. Res. Soc. 35 (1984) 425\u2013431.","journal-title":"J. Oper. Res. Soc."},{"key":"BF02096255_CR6","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/BF02242366","volume":"15","author":"W. Altherr","year":"1975","unstructured":"W. Altherr, An algorithm for enumerating all vertices of a convex polyhedron, Computing 15 (1975) 181\u2013193.","journal-title":"Computing"},{"key":"BF02096255_CR7","first-page":"217","volume":"12","author":"M. Altman","year":"1964","unstructured":"M. Altman, Optimum simplex methods and degeneracy in linear programming, Bull. de l'Acad. Polon. des Sci. 12 (1964) 217\u2013225.","journal-title":"Bull. de l'Acad. Polon. des Sci."},{"key":"BF02096255_CR8","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1090\/conm\/114\/1097871","volume":"114","author":"K.M. Anstreicher","year":"1990","unstructured":"K.M. Anstreicher, Dual ellipsoids and degeneracy in the projective algorithm for linear programming, in:Mathematical Developments Arising from Linear Programming: Proc. Joint Summer Research Conf., Bowdoin College, Brunswick, Maine, USA, June\/July 1988, eds. J.C. Lagarias and M.J. Todd, Contemp. Math. 114 (1990) 141\u2013149.","journal-title":"Contemp. Math."},{"key":"BF02096255_CR9","unstructured":"P. Armand, Programmation lin\u00e9aire multicrit\u00e8re et probl\u00e8mes de la d\u00e9g\u00e9n\u00e9rescence, Th\u00e8se de Doctorat de l'Universit\u00e9 de Limoges (1991)."},{"key":"BF02096255_CR10","doi-asserted-by":"crossref","unstructured":"P. Armand, Bounds for the number of vertices of perturbed polyhedra, Ann. Oper. Res. (1993), this volume.","DOI":"10.1007\/BF02023098"},{"key":"BF02096255_CR11","series-title":"Technical Report","volume-title":"On the nonequivalence of shadow prices and dual variables","author":"D.C. Aucamp","year":"1979","unstructured":"D.C. Aucamp and D.I. Steinberg, On the nonequivalence of shadow prices and dual variables, Technical Report WUCS-78-11, Dept. of Computer Sciences, Washington University, St. Louis, MS (1979)."},{"key":"BF02096255_CR12","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1057\/jors.1982.118","volume":"33","author":"D.C. Aucamp","year":"1982","unstructured":"D.C. Aucamp and D.I. Steinberg, The computation of shadow prices in linear programming, J. Oper. Res. 33 (1982) 557\u2013565.","journal-title":"J. Oper. Res."},{"key":"BF02096255_CR13","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BFb0121193","volume":"8","author":"D. Avis","year":"1978","unstructured":"D. Avis and V. Chv\u00e1tal, Notes on Bland's pivoting rule, Math. Progr. Study 8 (1978) 35\u201349.","journal-title":"Math. Progr. Study"},{"key":"BF02096255_CR14","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/BF01386081","volume":"6","author":"A.G. Azpeita","year":"1964","unstructured":"A.G. Azpeita and D.J. Dickinson, A decision rule in the simplex method that avoids cycling, Numer. Mathematik 6 (1964) 329\u2013331.","journal-title":"Numer. Mathematik"},{"key":"BF02096255_CR15","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, J. Soc. Ind. Appl. Math. 9 (1961) 72\u201388.","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"BF02096255_CR16","unstructured":"M.L. Balinski and J. Gale, The core of assignment games, Working Paper AD 2980487, Ecole Polytechnique de Paris (1985)."},{"key":"BF02096255_CR17","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1007\/BF01580885","volume":"35","author":"M.L. Balinski","year":"1986","unstructured":"M.L. Balinski, Th.M. Liebling and A.-E. Nobs, On the average length of lexicographic paths, Math. Progr. 35 (1986) 362\u2013364.","journal-title":"Math. Progr."},{"key":"BF02096255_CR18","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/BF02592024","volume":"36","author":"E.R. Barnes","year":"1986","unstructured":"E.R. Barnes, A variation of Karmarkar's algorithm for solving linear programming problems, Math. Progr. 36 (1986) 174\u2013182.","journal-title":"Math. Progr."},{"key":"BF02096255_CR19","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1090\/conm\/114\/1097870","volume":"114","author":"E.R. Barnes","year":"1990","unstructured":"E.R. Barnes, Some results concerning convergence of the affine scaling algorithm, in:Mathematical Developments Arising from Linear Programming, Proc. Joint Summer Research Conf., Bowdoin College, Brunswick, Maine, June\/July 1988, eds. J.C. Lagarias and M.J. Todd, Contemp. Math. 114 (1990) 131\u2013139.","journal-title":"Contemp. Math."},{"key":"BF02096255_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01584319","volume":"13","author":"R.S. Barr","year":"1977","unstructured":"R.S. Barr, F. Glover and D. Klingman, The alternating basis algorithm for assignment problems, Math. Progr. 13 (1977) 1\u201313.","journal-title":"Math. Progr."},{"key":"BF02096255_CR21","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0377-2217(78)90110-8","volume":"2","author":"R.S. Barr","year":"1978","unstructured":"R.S. Barr, F. Glover and D. Klingman, The generalized alternating path algorithm for transportation problems, Eur. J. Oper. Res. 2 (1978) 137\u2013144.","journal-title":"Eur. J. Oper. Res."},{"key":"BF02096255_CR22","first-page":"433","volume":"9","author":"H.G. Bartels","year":"1988","unstructured":"H.G. Bartels, Glanz und Elend konvexer Polyeder, Wirtschaftswissenschaftliches Studium 9 (1988) 433\u2013437.","journal-title":"Wirtschaftswissenschaftliches Studium"},{"key":"BF02096255_CR23","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1137\/0715017","volume":"15","author":"R.H. Bartels","year":"1978","unstructured":"R.H. Bartels, A.R. Conn and C. Charambolous, On Cline's direct method for solving over-determined linear systems in thel \u221e sense, SIAM J. Numer. Anal. 15 (1978) 255\u2013270.","journal-title":"SIAM J. Numer. Anal."},{"key":"BF02096255_CR24","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1137\/0715015","volume":"15","author":"R.H. Bartels","year":"1978","unstructured":"R.H. Bartels, A.R. Conn and J.W. Sinclair, Minimization techniques for piecewise differentiable functions: Thel 1 solution to an overdetermined linear system, SIAM J. Numer. Anal. 15 (1978) 224\u2013241.","journal-title":"SIAM J. Numer. Anal."},{"key":"BF02096255_CR25","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. Quart. 2 (1955) 269\u2013276.","journal-title":"Naval Res. Log. Quart."},{"key":"BF02096255_CR26","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1007\/BF01584344","volume":"13","author":"M. Benichou","year":"1977","unstructured":"M. Benichou, J.M. Gauthier, G. Hentges and G. Ribi\u00e8re, The efficient solution of large-scale linear programming problems \u2014 some algorithmic techniques and computational results, Math. Progr. 13 (1977) 280\u2013322.","journal-title":"Math. Progr."},{"key":"BF02096255_CR27","series-title":"Technical Report","volume-title":"A simplified proof of the general convergence of affine scaling","author":"J.R. Birge","year":"1991","unstructured":"J.R. Birge and C. Rosa, A simplified proof of the general convergence of affine scaling, Technical Report 91-7, Dept. of Oper. Res., University of Michigan, Ann Arbor (1991)."},{"key":"BF02096255_CR28","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":"BF02096255_CR29","unstructured":"K. Boenchendorf, An optimality criterion for degenerated transportation problems, in:Methods of Operations Research 57, eds. Domschke et al. (1987) pp. 87\u201394."},{"key":"BF02096255_CR30","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1137\/0901037","volume":"1","author":"P.H. Calamai","year":"1980","unstructured":"P.H. Calamai and C. Charambolous, Solving multifacility location problems involving Euclidean distances, SIAM J. Sci. Stat. Comput. 1 (1980) 609\u2013620.","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"BF02096255_CR31","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1137\/0901037","volume":"1","author":"P.H. Calamai","year":"1980","unstructured":"P.H. Calamai and A.R. Conn, A stable algorithm for solving the multifacility location problem involving Euclidean distances, SIAM J. Sci. Stat. Comput. 1 (1980) 512\u2013526.","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"BF02096255_CR32","doi-asserted-by":"crossref","unstructured":"P.H. Calamai and A.R. Conn, A second-order method for solving the continuous multifacility location problem, in:Numerical Analysis, Proc. 9th Biennial Conf., Dundee, Scotland, ed. G.A. Watson, Lecture Notes in Mathematics (Springer, 1982) pp. 1\u201325.","DOI":"10.1007\/BFb0093145"},{"key":"BF02096255_CR33","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/BF02592073","volume":"39","author":"P.H. Calamai","year":"1987","unstructured":"P.H. Calamai and J.J. Moore, Projected gradient methods for linearly constrained problems, Math. Progr. 39 (1987) 93\u2013116.","journal-title":"Math. Progr."},{"key":"BF02096255_CR34","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1017\/S1446788700039513","volume":"43","author":"N. Cameron","year":"1987","unstructured":"N. Cameron, Stationarity in the simplex method, J. Austral. Math. Soc., Series A 43 (1987) 137\u2013142.","journal-title":"J. Austral. Math. Soc., Series A"},{"key":"BF02096255_CR35","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF01588308","volume":"18","author":"Y.Y. Chang","year":"1980","unstructured":"Y.Y. Chang and R.W. Cottle, Least-index resolution of degeneracy in quadratic programming, Math. Progr. 18 (1980) 27\u201337.","journal-title":"Math. Progr."},{"key":"BF02096255_CR36","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":"BF02096255_CR37","unstructured":"M. Cirina, Remarks on a recent simplex pivoting rule, in:Methods of Operations Research 55: Proc. 9th Symp. on Operations Research, K\u00f6nigsstein\/Ts, eds. W. Domschke et al. (1985) pp. 187\u2013199."},{"key":"BF02096255_CR38","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1287\/moor.4.2.196","volume":"4","author":"W.H. Cunningham","year":"1979","unstructured":"W.H. Cunningham, Theoretical properties of the network simplex method, Math. Oper. Res. 4 (1979) 196\u2013208.","journal-title":"Math. Oper. Res."},{"key":"BF02096255_CR39","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1007\/BF02592054","volume":"26","author":"W.H. Cunningham","year":"1983","unstructured":"W.H. Cunningham and J.G. Klincewicz, On cycling in the network simplex method, Math. Progr. 26 (1983) 182\u2013189.","journal-title":"Math. Progr."},{"key":"BF02096255_CR40","doi-asserted-by":"crossref","unstructured":"G.B. Dantzig,Linear Programming and Extensions (Princeton University Press, 1963).","DOI":"10.7249\/R366"},{"issue":"115","key":"BF02096255_CR41","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0024-3795(89)90464-3","volume":"114","author":"G.B. Dantzig","year":"1989","unstructured":"G.B. Dantzig, Making progress during a stall in the simplex algorithm, Lin. Alg. Appl. 114\/115 (1989) 251\u2013259.","journal-title":"Lin. Alg. Appl."},{"key":"BF02096255_CR42","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":"BF02096255_CR43","doi-asserted-by":"crossref","unstructured":"A. Dax, On computational aspects of bounded linear least squares problems, ACM Trans. Math. Soft. 17 (1991).","DOI":"10.1145\/103147.103155"},{"key":"BF02096255_CR44","doi-asserted-by":"crossref","unstructured":"U. Derigs, Neuere Ans\u00e4tze in der linearen Optimierung \u2014 Motivation, Konzepte und Verfahren, in:Operations Research Proc., eds. L. Streitferdt et al. (Springer, 1986) pp. 47\u201358.","DOI":"10.1007\/978-3-642-71161-9_4"},{"key":"BF02096255_CR45","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1002\/nav.3800290312","volume":"29","author":"U. Derigs","year":"1982","unstructured":"U. Derigs, On three basic methods for solving bottleneck transportation problems, Naval Res. Log. Quart. 29 (1982) 505\u2013515.","journal-title":"Naval Res. Log. Quart."},{"key":"BF02096255_CR46","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1287\/moor.8.3.381","volume":"8","author":"M.E. Dyer","year":"1983","unstructured":"M.E. Dyer, The complexity of vertex enumeration methods, Math. Oper. Res. 8 (1983) 381\u2013402.","journal-title":"Math. Oper. Res."},{"key":"BF02096255_CR47","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. Progr. 12 (1977) 81\u201396.","journal-title":"Math. Progr."},{"key":"BF02096255_CR48","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":"BF02096255_CR49","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1111\/j.1540-5915.1982.tb00155.x","volume":"13","author":"J.R. Evans","year":"1982","unstructured":"J.R. Evans and N.R. Baker, Degeneracy and the (mis)interpretation of sensitivity analysis in linear programming, Dec. Sci. 13 (1982) 348\u2013354.","journal-title":"Dec. Sci."},{"key":"BF02096255_CR50","unstructured":"B. Fleischmann, Duale und primale Schnittebenenverfahren in der ganzzahligen linearen Optimierung, Dissertation, Universit\u00e4t Hamburg (1970)."},{"key":"BF02096255_CR51","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF01580769","volume":"41","author":"R. Fourer","year":"1988","unstructured":"R. Fourer, A simplex algorithm for piecewise-linear programming II: finiteness, feasibility and degeneracy, Math. Progr. 41 (1988) 281\u2013315.","journal-title":"Math. Progr."},{"key":"BF02096255_CR52","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0377-2217(77)90063-7","volume":"1","author":"T. Gal","year":"1977","unstructured":"T. Gal, A general method for determining the set of all efficient solutions to a linear vector-maximum problem, Eur. J. Oper. Res. 1 (1977) 307\u2013322.","journal-title":"Eur. J. Oper. Res."},{"key":"BF02096255_CR53","unstructured":"T. Gal,Postoptimal Analyses, Parametric Programming, and Related Topics (McGraw-Hill, 1979)."},{"key":"BF02096255_CR54","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":"BF02096255_CR55","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF01719736","volume":"8","author":"T. Gal","year":"1986","unstructured":"T. Gal, Shadow prices and sensitivity analysis in linear programming under degeneracy \u2014 State-of-the-art survey, OR Spektrum 8 (1986) 59\u201371.","journal-title":"OR Spektrum"},{"key":"BF02096255_CR56","first-page":"3","volume":"6","author":"T. Gal","year":"1990","unstructured":"T. Gal, Degeneracy in mathematical programming and degeneracy graphs, ORiON 6 (1990) 3\u201336.","journal-title":"ORiON"},{"key":"BF02096255_CR57","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, Eur. J. Oper. Res. 60 (1992) 315\u2013326.","journal-title":"Eur. J. Oper. Res."},{"key":"BF02096255_CR58","doi-asserted-by":"crossref","unstructured":"T. Gal, Degeneracy graphs: Theory and application \u2014 A survey, Ann. Oper. Res. (1993), this volume.","DOI":"10.1007\/BF02096258"},{"key":"BF02096255_CR59","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":"BF02096255_CR60","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF01589397","volume":"42","author":"T. Gal","year":"1988","unstructured":"T. Gal, H.-J. Kruse and P. Z\u00f6rnig, Survey of solved and open problems in the degeneracy phenomenon, Math. Progr. 42 (1988) 125\u2013133.","journal-title":"Math. Progr."},{"key":"BF02096255_CR61","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/BF01580397","volume":"11","author":"R.S. Garfinkel","year":"1976","unstructured":"R.S. Garfinkel and M.R. Rao, Bottleneck linear programming, Math. Progr. 11 (1976) 291\u2013298.","journal-title":"Math. Progr."},{"key":"BF02096255_CR62","doi-asserted-by":"crossref","first-page":"848","DOI":"10.1287\/opre.27.4.848","volume":"27","author":"S.I. Gass","year":"1979","unstructured":"S.I. Gass, Comments on the possibility of cycling with the simplex method, Oper. Res. 27 (1979) 848\u2013852.","journal-title":"Oper. Res."},{"key":"BF02096255_CR63","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1002\/nav.3800110104","volume":"11","author":"B.J. Gassner","year":"1964","unstructured":"B.J. Gassner, Cycling in the transportation problem, Naval Res. Log. Quart. 11 (1964) 43\u201358.","journal-title":"Naval Res. Log. Quart."},{"key":"BF02096255_CR64","unstructured":"D.M. Gay, Electronic mail distribution of linear programming test problems, Math. Progr. Soc. COAL Newsletter 1 (1985)."},{"key":"BF02096255_CR65","unstructured":"F. Geue, Eckenabsuchende Verfahren unter Entartung: Theorie, Algorithmen und Vergleichtests, Dissertation, FernUniversit\u00e4t Hagen (1993)."},{"key":"BF02096255_CR66","volume-title":"Numerical Linear Algebra and Optimization, Vol. 1","author":"P.E. Gill","year":"1991","unstructured":"P.E. Gill, W. Murray and M.H. Wright,Numerical Linear Algebra and Optimization, Vol. 1 (Addison-Wesley, Redwood City, 1991)."},{"key":"BF02096255_CR67","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1002\/nav.3800330409","volume":"33","author":"H.J. Greenberg","year":"1986","unstructured":"H.J. Greenberg, An analysis of degeneracy, Naval. Res. Log. Quart. 33 (1986) 635\u2013655.","journal-title":"Naval. Res. Log. Quart."},{"key":"BF02096255_CR68","doi-asserted-by":"crossref","unstructured":"O. G\u00fcler, D. den Hertog, C. Roos, T. Terlaky and T. Tsuchiya, Degeneracy in interior point methods for linear programming, Ann. Oper. Res. (1993), this volume.","DOI":"10.1007\/BF02096259"},{"key":"BF02096255_CR69","first-page":"222","volume":"14","author":"B. Gupta","year":"1983","unstructured":"B. Gupta and R. Gypta, Multi-criteria simplex method for a linear multiple objective transportation problem, Indian J. Pure Appl. Math. 14 (1983) 222\u2013232.","journal-title":"Indian J. Pure Appl. Math."},{"key":"BF02096255_CR70","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1002\/nav.3800160307","volume":"16","author":"P.L. Hammer","year":"1969","unstructured":"P.L. Hammer, Time-minimizing transportation problems, Naval Res. Log. Quart. 16 (1969) 345\u2013357.","journal-title":"Naval Res. Log. Quart."},{"key":"BF02096255_CR71","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01580108","volume":"5","author":"P.M.J. Harris","year":"1973","unstructured":"P.M.J. Harris, Pivot selection methods of the DEVEX LP code, Math. Progr. 5 (1973) 1\u201328.","journal-title":"Math. Progr."},{"key":"BF02096255_CR72","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/BF01589398","volume":"72","author":"R.S. Hattersley","year":"1988","unstructured":"R.S. Hattersley and J. Wilson, A dual approach to primal degeneracy, Math. Progr. 72 (1988) 135\u2013176.","journal-title":"Math. Progr."},{"key":"BF02096255_CR73","unstructured":"A.J. Hoffman, Cycling in the simplex algorithm, National Bureau of Standards Report No. 2974 (1953)."},{"key":"BF02096255_CR74","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0167-6377(88)90071-5","volume":"7","author":"R. Horst","year":"1988","unstructured":"R. Horst, J. de Vries and N.V. Thoai, On finding new vertices and redundant constraints in cutting plane algorithms for global optimization, Oper. Res. Lett. 7 (1988) 85\u201390.","journal-title":"Oper. Res. Lett."},{"key":"BF02096255_CR75","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1002\/nav.3800260112","volume":"26","author":"H. Isermann","year":"1979","unstructured":"H. Isermann, The enumeration of all efficient solutions for a linear multiple objective transportation problem, Naval Res. Log. Quart. 26 (1979) 123\u2013129.","journal-title":"Naval Res. Log. Quart."},{"key":"BF02096255_CR76","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1002\/nav.3800290116","volume":"29","author":"H. Juel","year":"1982","unstructured":"H. Juel, A note on solving multifacility location problems involving Euclidean distance, Naval Res. Log. Quart. 29 (1982) 179\u2013180.","journal-title":"Naval Res. Log. Quart."},{"key":"BF02096255_CR77","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1057\/jors.1976.145","volume":"27","author":"H. Juel","year":"1976","unstructured":"H. Juel and R.F. Love, An efficient computational procedure for solving the multifacility rectilinear location problem, Oper. Res. Quart. 27 (1976) 697\u2013703.","journal-title":"Oper. Res. Quart."},{"key":"BF02096255_CR78","doi-asserted-by":"crossref","unstructured":"M.H. Karwan, V. Lotfi, J. Telgen and S. Zionts,Redundancy in Mathematical Programming (Springer, 1983).","DOI":"10.1007\/978-3-642-45535-3"},{"key":"BF02096255_CR79","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0167-6377(89)90051-5","volume":"8","author":"D.B. Khang","year":"1989","unstructured":"D.B. Khang and O. Fujiwara, A new algorithm to find all vertices of a polytope, Oper. Res. Lett. 8 (1989) 261\u2013264.","journal-title":"Oper. Res. Lett."},{"key":"BF02096255_CR80","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1016\/0305-0483(76)90124-9","volume":"4","author":"G. Knolmayer","year":"1976","unstructured":"G. Knolmayer, How many sided are shadow prices at degenerate primal optima?, OMEGA 4 (1976) 493\u2013494.","journal-title":"OMEGA"},{"key":"BF02096255_CR81","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1111\/j.1540-5915.1984.tb01193.x","volume":"15","author":"G. Knolmayer","year":"1984","unstructured":"G. Knolmayer, The effect of degeneracy on cost-efficient ranges and an algorithm to resolve interpretation problems, Dec. Sci. 15 (1984) 14\u201321.","journal-title":"Dec. Sci."},{"key":"BF02096255_CR82","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01582098","volume":"16","author":"M.M. Kostreva","year":"1979","unstructured":"M.M. Kostreva, Cycling in linear complementarity problems, Math. Progr. 16 (1979) 127\u2013130.","journal-title":"Math. Progr."},{"key":"BF02096255_CR83","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1287\/opre.26.2.374","volume":"26","author":"T.C.T. Kotiah","year":"1978","unstructured":"T.C.T. Kotiah and D.I. Steinberg, On the possibility of cycling with the simplex method, Oper. Res. 26 (1978) 374\u2013376.","journal-title":"Oper. Res."},{"key":"BF02096255_CR84","doi-asserted-by":"crossref","unstructured":"H.-J. Kruse,Degeneracy Graphs and the Neighbourhood Problem, Lecture Notes in Economics and Mathematical Systems No. 260 (Springer, 1986).","DOI":"10.1007\/978-3-642-49270-9"},{"key":"BF02096255_CR85","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1057\/jors.1967.28","volume":"19","author":"Madan Lal Mittal","year":"1967","unstructured":"Madan Lal Mittal, A note on resolution of degeneracy in transportation problems, Oper. Res. Quart. 19 (1967) 175\u2013184.","journal-title":"Oper. Res. Quart."},{"key":"BF02096255_CR86","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/BF01580770","volume":"41","author":"T.L. Magnanti","year":"1988","unstructured":"T.L. Magnanti and J.B. Orlin, Parametric linear programming and anti-cycling pivoting rules, Math. Progr. 41 (1988) 317\u2013325.","journal-title":"Math. Progr."},{"key":"BF02096255_CR87","unstructured":"A. Majthay, On degeneracy and cycling with the simplex method, Discussion Paper No. 41, Center for Econometrics and Decision Sciences, University of Florida (1981)."},{"key":"BF02096255_CR88","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. Quart. 16 (1969) 121\u2013137.","journal-title":"Naval Res. Log. Quart."},{"key":"BF02096255_CR89","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1287\/moor.5.2.167","volume":"5","author":"T.H. Mattheiss","year":"1980","unstructured":"T.H. Mattheiss and D.S. Rubin, A survey and comparison of methods for finding all vertices of convex polyhedral sets, Math. Oper. Res. 5 (1980) 167\u2013185.","journal-title":"Math. Oper. Res."},{"key":"BF02096255_CR90","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/BF01609041","volume":"15","author":"P.G. McKeown","year":"1978","unstructured":"P.G. McKeown, Some computational results of using the Ahrens-Finke method for handling degeneracy in fixed charge transportation problems, Math. Progr. 15 (1978) 355\u2013359.","journal-title":"Math. Progr."},{"key":"BF02096255_CR91","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF01580886","volume":"35","author":"N. Megiddo","year":"1986","unstructured":"N. Megiddo, A note on degeneracy in linear programming, Math. Progr. 35 (1986) 365\u2013367.","journal-title":"Math. Progr."},{"key":"BF02096255_CR92","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0024-3795(91)90277-4","volume":"152","author":"S. Mehrotra","year":"1991","unstructured":"S. Mehrotra, On finding a vertex solution using interior point methods, Lin. Alg. Appl. 152 (1991) 233\u2013253.","journal-title":"Lin. Alg. Appl."},{"key":"BF02096255_CR93","first-page":"201","volume":"29","author":"V. Mlyn\u00e1rovi\u010d","year":"1988","unstructured":"V. Mlyn\u00e1rovi\u010d, On shadow prices in convex programming, Mat.-Ekon. Obzor 29 (1988) 201\u2013214.","journal-title":"Mat.-Ekon. Obzor"},{"key":"BF02096255_CR94","doi-asserted-by":"crossref","unstructured":"P. Nash,Algebraic Fundamentals of Linear Programming, Lecture Notes in Economics and Mathematical Systems No. 259 (Springer, 1985) pp. 37\u201352.","DOI":"10.1007\/978-3-642-46564-2_4"},{"key":"BF02096255_CR95","doi-asserted-by":"crossref","first-page":"402","DOI":"10.2307\/1927010","volume":"259","author":"R.R. Nelson","year":"1957","unstructured":"R.R. Nelson, Degeneracy in linear programming: A simple geometrical interpretation, Rev. Econ. Statist. 259 (1957) 402\u2013407.","journal-title":"Rev. Econ. Statist."},{"key":"BF02096255_CR96","unstructured":"M. Niggemeier, Entartungserscheinungen bei ganzzahligen Optimierungsproblemen \u2014 Eine \u00dcbersicht, Diplomarbeit, Fachbereich Wirtschaftswissenschaft, FernUniversit\u00e4t Hagen (1989)."},{"key":"BF02096255_CR97","doi-asserted-by":"crossref","unstructured":"M. Niggemeier, Degeneracy in integer linear optimization problems: A survey, Ann. Oper. Res. (1993), this volume.","DOI":"10.1007\/BF02096263"},{"key":"BF02096255_CR98","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0167-6377(87)90009-5","volume":"6","author":"B. Nygreen","year":"1987","unstructured":"B. Nygreen, A possible way to reduce degeneracy in integer programming computations, Oper. Res. Lett. 6 (1987) 47\u201351.","journal-title":"Oper. Res. Lett."},{"key":"BF02096255_CR99","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF01721801","volume":"12","author":"P.-Q. Pan","year":"1990","unstructured":"P.-Q. Pan, Practical finite pivoting rules for the simplex method, OR Spektrum 12 (1990) 219\u2013225.","journal-title":"OR Spektrum"},{"key":"BF02096255_CR100","unstructured":"A.F. Perold, Exploiting degeneracy in the simplex method, in:Large Scale Linear Programming (IIASA, 1981)."},{"key":"BF02096255_CR101","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/BF01584348","volume":"13","author":"J. Philip","year":"1977","unstructured":"J. Philip, Vector maximization at a degenerate vertex, Math. Progr. 13 (1977) 357\u2013359.","journal-title":"Math. Progr."},{"key":"BF02096255_CR102","first-page":"83","volume":"12","author":"L.G. Proll","year":"1987","unstructured":"L.G. Proll, Goal aggregation via shadow prices \u2014 some counterexamples, Large Scale Syst. 12 (1987) 83\u201385.","journal-title":"Large Scale Syst."},{"key":"BF02096255_CR103","volume-title":"Methodology and Software for Interactive Decision Support","author":"R. Ramesh","year":"1987","unstructured":"R. Ramesh, M.H. Karwan and S. Zionts, Degeneracy in efficiency testing in bi-criteria integer programming, in:Methodology and Software for Interactive Decision Support, presented at IIASA, Laxenburg (1987)."},{"key":"BF02096255_CR104","first-page":"307","volume":"92","author":"K. Ritter","year":"1984","unstructured":"K. Ritter, On parametric linear and quadratic programming problems, Math. Progr. 92 (1984) 307\u2013335.","journal-title":"Math. Progr."},{"key":"BF02096255_CR105","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/BF01580883","volume":"35","author":"A. Ruszczynski","year":"1986","unstructured":"A. Ruszczynski, A regularized decomposition method for minimizing a sum of polyhedral functions, Math. Progr. 35 (1986) 309\u2013333.","journal-title":"Math. Progr."},{"key":"BF02096255_CR106","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/BF01580776","volume":"41","author":"D.M. Ryan","year":"1988","unstructured":"D.M. Ryan and M.R. Osborne, On the solution of highly degenerate linear programmes, Math. Progr. 41 (1988) 385\u2013392.","journal-title":"Math. Progr."},{"key":"BF02096255_CR107","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/0377-2217(82)90178-3","volume":"9","author":"C.R. Seshan","year":"1982","unstructured":"C.R. Seshan and K.K. Achary, On the bottleneck linear programming problems, Eur. J. Oper. Res. 9 (1982) 347\u2013352.","journal-title":"Eur. J. Oper. Res."},{"key":"BF02096255_CR108","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1016\/0305-0548(86)90034-1","volume":"13","author":"H.D. Sherali","year":"1986","unstructured":"H.D. Sherali and S.E. Dickey, An extreme-point-ranking algorithm for the extreme point mathematical programming problem, Comp. Oper. Res. 13 (1986) 465\u2013475.","journal-title":"Comp. Oper. Res."},{"key":"BF02096255_CR109","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.11.1.1","volume":"11","author":"V. Srinivasan","year":"1977","unstructured":"V. Srinivasan and G.L. Thompson, Determining cost vs. time Pareto-optimal frontiers in multi-modal transportation problems, Transp. Sci. 11 (1977) 1\u201319.","journal-title":"Transp. Sci."},{"key":"BF02096255_CR110","doi-asserted-by":"crossref","first-page":"160","DOI":"10.2307\/2490273","volume":"7","author":"J.E. Strum","year":"1969","unstructured":"J.E. Strum, Note on two-sided shadow prices, J. Account. Res. 7 (1969) 160\u2013162.","journal-title":"J. Account. Res."},{"key":"BF02096255_CR111","first-page":"8","volume":"2","author":"J. Telgen","year":"1980","unstructured":"J. Telgen, A note on a linear programming problem that cycled, COAL Newsletter 2 (1980) 8\u201311.","journal-title":"COAL Newsletter"},{"key":"BF02096255_CR112","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1287\/mnsc.12.7.588","volume":"23","author":"G.L. Thompson","year":"1966","unstructured":"G.L. Thompson, F.M. Tonge and S. Zionts, Techniques for removing nonbinding constraints and extraneous variables from linear programming problems, Manag. Sci. 23 (1966) 588\u2013608.","journal-title":"Manag. Sci."},{"key":"BF02096255_CR113","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1007\/BF01583778","volume":"23","author":"M.J. Todd","year":"1982","unstructured":"M.J. Todd, An implementation of the simplex method for linear programming problems with variable upper bounds, Math. Progr. 23 (1982) 34\u201349.","journal-title":"Math. Progr."},{"key":"BF02096255_CR114","unstructured":"M.J. Todd, The effects of degeneracy, null and unbounded variables on variants of Karamarkar's linear programming algorithm, in:Large Scale Numerical Optimization, Proc. Workshop, Cornell University, Ithaca, eds. T.F. Coleman and Y. Li (SIAM, 1990) pp 81\u201391."},{"key":"BF02096255_CR115","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1287\/moor.16.4.671","volume":"16","author":"M.J. Todd","year":"1991","unstructured":"M.J. Todd, Probabilistic models for linear programming, Math. Oper. Res. 16 (1991) 671\u2013693.","journal-title":"Math. Oper. Res."},{"key":"BF02096255_CR116","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/BF02591947","volume":"27","author":"J.A. Tomlin","year":"1983","unstructured":"J.A. Tomlin and J.S. Welch, Formal optimization of some reduced linear programming problems, Math. Progr. 27 (1983) 232\u2013240.","journal-title":"Math. Progr."},{"key":"BF02096255_CR117","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1016\/S0377-2217(87)80153-4","volume":"32","author":"J. V\u00f6r\u00f6s","year":"1987","unstructured":"J. V\u00f6r\u00f6s, The explicit derivation of the efficient portfolio frontier in the case of degeneracy and general singularity, Eur. J. Oper. Res. 32 (1987) 302\u2013310.","journal-title":"Eur. J. Oper. Res."},{"key":"BF02096255_CR118","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":"BF02096255_CR119","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1137\/0111006","volume":"11","author":"A.C. Williams","year":"1963","unstructured":"A.C. Williams, Marginal values in linear programming, J. Soc. Ind. Appl. Math. 11 (1963) 82\u201394.","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"BF02096255_CR120","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, J. Soc. Ind. Appl. Math. 11 (1963) 305\u2013311.","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"BF02096255_CR121","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1287\/opre.16.4.750","volume":"16","author":"R.D. Young","year":"1968","unstructured":"R.D. Young, A simplified primal (all-integer) integer programming algorithm, Oper. Res. 16 (1968) 750\u2013782.","journal-title":"Oper. Res."},{"key":"BF02096255_CR122","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0167-6377(91)90058-W","volume":"10","author":"S. Zhang","year":"1991","unstructured":"S. Zhang, On anti-cycling pivoting rules for the simplex method, Oper. Res. Lett. 10 (1991) 189\u2013192.","journal-title":"Oper. Res. Lett."},{"key":"BF02096255_CR123","doi-asserted-by":"crossref","unstructured":"P. Z\u00f6rnig,Degeneracy Graphs and Simplex Cycling, Lecture Notes in Economics and Mathematical Systems No. 357 (Springer, 1991).","DOI":"10.1007\/978-3-642-45702-9"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02096255.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02096255\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02096255","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T11:06:12Z","timestamp":1586430372000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02096255"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,3]]},"references-count":123,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,3]]}},"alternative-id":["BF02096255"],"URL":"https:\/\/doi.org\/10.1007\/bf02096255","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,3]]}}}