Pages that link to "Item:Q4196237"
From MaRDI portal
The following pages link to New Finite Pivoting Rules for the Simplex Method (Q4196237):
Displayed 50 items.
- Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids (Q584271) (← links)
- Exact optimization for the \(\ell ^{1}\)-compressive sensing problem using a modified Dantzig-Wolfe method (Q630594) (← links)
- Degeneracy resolution for bilinear utility functions (Q650206) (← links)
- A primal-dual simplex method for linear programs (Q688212) (← links)
- A new version of the improved primal simplex for degenerate linear programs (Q733525) (← links)
- The discrete moment problem and linear programming (Q749441) (← links)
- Modeling the satellite placement problem as a network flow problem with one side constraint (Q751497) (← links)
- Practical finite pivoting rules for the simplex method (Q751498) (← links)
- On the structure of the set bases of a degenerate point (Q795747) (← links)
- Canonical bases in linear programming (Q908850) (← links)
- An exponential example for Terlaky's pivoting rule for the criss-cross simplex method (Q911455) (← links)
- A note on the continuity of solutions of parametric linear programs (Q917451) (← links)
- The basis suppression method (Q918407) (← links)
- Efficient nested pricing in the simplex algorithm (Q943787) (← links)
- An exterior simplex type algorithm for the minimum cost network flow problem (Q958451) (← links)
- Multi-phase dynamic constraint aggregation for set partitioning type problems (Q964175) (← links)
- Pivoting rules and redundancy schemes in extreme point enumeration (Q1063390) (← links)
- A finite crisscross method for oriented matroids (Q1073036) (← links)
- Shadow prices and sensitivity analysis in linear programming under degeneracy. State-of-the-art-survey (Q1075251) (← links)
- Linear and combinatorial sharing problems (Q1081535) (← links)
- A note on the Edmonds-Fukuda pivoting rule for simplex algorithms (Q1095028) (← links)
- A Z-simplex algorithm with partial updates (Q1097835) (← links)
- Survey of solved and open problems in the degeneracy phenomenon (Q1101009) (← links)
- A dual approach to primal degeneracy (Q1102188) (← links)
- An experimental investigation of enumerative methods for the linear complementarity problem (Q1104872) (← links)
- Degeneracy in the presence of roundoff errors (Q1105984) (← links)
- On the solution of highly degenerate linear programmes (Q1106719) (← links)
- A degenerate extreme point strategy for the classification of linear constraints as redundant or necessary (Q1106721) (← links)
- Parametric linear programming and anti-cycling pivoting rules (Q1108192) (← links)
- A simplex algorithm for piecewise-linear programming. II: Finiteness, feasibility and degeneracy (Q1110457) (← links)
- Making progress during a stall in the simplex algorithm (Q1116654) (← links)
- Subspaces with well-scaled frames (Q1122483) (← links)
- On anti-cycling pivoting rules for the simplex method (Q1178727) (← links)
- A sequential LCP method for bilevel linear programming (Q1184523) (← links)
- A new pivoting rule for solving various degeneracy problems (Q1198621) (← links)
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra (Q1199131) (← links)
- A combinatorial abstraction of linear programming (Q1245770) (← links)
- A practical anti-cycling procedure for linearly constrained optimization (Q1264089) (← links)
- Selected bibliography on degeneracy (Q1312748) (← links)
- Degeneracy graphs: Theory and applications. An updated survey (Q1312751) (← links)
- Combinatoric classes of the transportation problem and their properties (Q1312755) (← links)
- Degeneracy in linear complementarity problems: A survey (Q1312757) (← links)
- Pivot rules for linear programming: A survey on recent theoretical developments (Q1312760) (← links)
- Encounters with degeneracy: A personal view (Q1312770) (← 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)
- An exterior point simplex algorithm for (general) linear programming problems (Q1312781) (← links)
- A general technique for dealing with degeneracy in reduced gradient methods for linearly constrained nonlinear programming (Q1327826) (← links)
- Standard forms for rational linear arithmetic in constraint logic programming. (Q1354046) (← links)
- Criss-cross methods: A fresh view on pivot algorithms (Q1365063) (← links)