Pages that link to "Item:Q3976517"
From MaRDI portal
The following pages link to On the complexity of linear programming (Q3976517):
Displaying 17 items.
- A deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy (Q306252) (← links)
- A counterexample to the Hirsch conjecture (Q447933) (← links)
- Hybrid-LP: finding advanced starting points for simplex, and pivoting LP methods (Q709179) (← links)
- On the complexity of linear programming in the BSS-model (Q1302143) (← links)
- Linear programming, complexity. Separation and optimization. (Q1612911) (← links)
- On the teaching complexity of linear sets (Q1704564) (← links)
- Strong polynomiality of the Gass-Saaty shadow-vertex pivoting rule for controlled random walks (Q1945076) (← links)
- Predictor-corrector primal-dual interior point method for solving economic dispatch problems: a postoptimization analysis (Q1954726) (← links)
- Machine-part cell formation using biclustering (Q2356028) (← links)
- Solving generic nonarchimedean semidefinite programs using stochastic game algorithms (Q2409007) (← links)
- A decision procedure for linear ``big O'' equations (Q2642465) (← links)
- On the Teaching Complexity of Linear Sets (Q2835620) (← links)
- Improving Strategies via SMT Solving (Q3000582) (← links)
- Tropicalizing the Simplex Algorithm (Q3453613) (← links)
- The Efficiency of the Simplex Method: A Survey (Q3753810) (← links)
- Computability of validity and satisfiability in probability logics over finite and countable models (Q4586148) (← links)
- Optimizing reachability probabilities for a restricted class of stochastic hybrid automata via flowpipe construction (Q6599370) (← links)
