Pages that link to "Item:Q1198621"
From MaRDI portal
The following pages link to A new pivoting rule for solving various degeneracy problems (Q1198621):
Displaying 12 items.
- Adjacency based method for generating maximal efficient faces in multiobjective linear programming (Q345543) (← links)
- Weakly redundant constraints and their impact on postoptimal analyses in LP (Q1199513) (← links)
- Selected bibliography on degeneracy (Q1312748) (← links)
- Degeneracy graphs: Theory and applications. An updated survey (Q1312751) (← links)
- On degeneracy and collapsing in the construction of the set of objective values in a multiple objective linear program (Q1312767) (← links)
- An improved \(N\)-tree algorithm for the enumeration of all neighbors of a degenerate vertex (Q1312773) (← links)
- On some properties of \(0\)-degeneracy graphs (Q1312774) (← links)
- Enumerating extreme points of a highly degenerate polytope (Q1318458) (← links)
- Degeneracy subgraph of the Lemke complementary pivot algorithm and anticycling rule (Q1367725) (← links)
- A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program (Q1600950) (← links)
- Generalized \(\gamma\)-valid cut procedure for concave minimization (Q1807817) (← links)
- Systematic construction of examples for cycling in the simplex method (Q2489285) (← links)
