Pages that link to "Item:Q3914757"
From MaRDI portal
The following pages link to Khachiyan’s algorithm for linear programming (Q3914757):
Displayed 21 items.
- Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses (Q789319) (← links)
- The \(p\)-hub center allocation problem (Q852943) (← links)
- The vertices of the knapsack polytope (Q1056676) (← links)
- Neighborhood perfect graphs (Q1081622) (← links)
- Complexity, convexity and combinations of theories (Q1141138) (← links)
- On relaxation methods for systems of linear inequalities (Q1159953) (← links)
- The ellipsoid method and its consequences in combinatorial optimization (Q1168215) (← links)
- An appraisal of computational complexity for operations researchers (Q1173532) (← links)
- Projection algorithms for linear programming (Q1199509) (← links)
- Method of centers for minimizing generalized eigenvalues (Q1260783) (← links)
- New iterative methods for linear inequalities (Q1321142) (← links)
- Simplices by point-sliding and the Yamnitsky-Levin algorithm (Q1366323) (← links)
- Fast finite methods for a system of linear inequalities (Q1819897) (← links)
- The ellipsoid method and its implications (Q1835842) (← links)
- The sphere method and the robustness of the ellipsoid algorithm (Q3039036) (← links)
- Fractional covers for forests and matchings (Q3315281) (← links)
- Optimization problems with algebraic solutions: Quadratic fractional programs and ratio games (Q3688122) (← links)
- A Variable-Complexity Norm Maximization Problem (Q3718152) (← links)
- A finite algorithm for the continuousp-center location problem on a graph (Q3724065) (← links)
- On Estimating Optimal Bases for Linear Programs (Q3731365) (← links)
- Modifications and implementation of the ellipsoid algorithm for linear programming (Q3934131) (← links)