Degeneracy graphs and the neighbourhood problem
From MaRDI portal
Publication:1072933
zbMath0587.90062MaRDI QIDQ1072933
Publication date: 1986
Published in: Lecture Notes in Economics and Mathematical Systems (Search for Journal in Brave)
degenerationsolution methoddegeneracy graphsdegenerate vertices of convex polyhedraneighbourhood problems
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Numerical mathematical programming methods (65K05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Survey of solved and open problems in the degeneracy phenomenon, Practical issues on the projection of polyhedral sets, On the line graphs of the complete \(r\)-partite graphs, Mathematical systems for enhancing diffuse images of point sources, Fourier algorithm revisited, A new pivoting rule for solving various degeneracy problems, Weakly redundant constraints and their impact on postoptimal analyses in LP, On the connectedness of optimum-degeneracy graphs, A reverse search algorithm for the neighborhood problem, Selected bibliography on degeneracy, Degeneracy graphs: Theory and applications. An updated survey, Bounds on the number of vertices of perturbed polyhedra, On degeneracy and collapsing in the construction of the set of objective values in a multiple objective linear program, An improved \(N\)-tree algorithm for the enumeration of all neighbors of a degenerate vertex, On some properties of \(0\)-degeneracy graphs, A theory of degeneracy graphs, Finding all maximal efficient faces in multiobjective linear programming, Determination of the efficient set in multiobjective linear programming, Shadow prices and sensitivity analysis in linear programming under degeneracy. State-of-the-art-survey
