scientific article; zbMATH DE number 19091

MaRDI QIDQ3976517zbMATH OpenFDO

Authors Nimrod Megiddo

Publication date 26 June 1992

zbMATH Keywords

ellipsoid methodinterior point methodsprobabilistic analysisstrongly polynomial algorithmssurvey

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Linear programming (90C05) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• scientific article; zbMATH DE number 898014
• Linear Programming in O([n3/ln n]L) Operations
• A new polynomial-time algorithm for linear programming
• scientific article; zbMATH DE number 4060993
• scientific article; zbMATH DE number 1310536

Cited in

(24)

• On the complexity of linear programming in the BSS-model
• Linear programming, complexity. Separation and optimization.
• On the teaching complexity of linear sets
• Strong polynomiality of the Gass-Saaty shadow-vertex pivoting rule for controlled random walks
• Predictor-corrector primal-dual interior point method for solving economic dispatch problems: a postoptimization analysis
• Machine-part cell formation using biclustering
• A decision procedure for linear ``big O equations
• On the Teaching Complexity of Linear Sets
• Improving strategies via SMT solving
• A deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy
• Men and progress in linear programming
• scientific article; zbMATH DE number 3876926 (Why is no real title available?)
• Tropicalizing the simplex algorithm
• scientific article; zbMATH DE number 3945887 (Why is no real title available?)
• scientific article; zbMATH DE number 3987052 (Why is no real title available?)
• The Efficiency of the Simplex Method: A Survey
• scientific article; zbMATH DE number 4020842 (Why is no real title available?)
• A counterexample to the Hirsch conjecture
• Computability of validity and satisfiability in probability logics over finite and countable models
• scientific article; zbMATH DE number 898014 (Why is no real title available?)
• scientific article; zbMATH DE number 2208706 (Why is no real title available?)
• Optimizing reachability probabilities for a restricted class of stochastic hybrid automata via flowpipe construction
• On infinity type hyperplane arrangements and convex positive bijections
• Hybrid-LP: finding advanced starting points for simplex, and pivoting LP methods

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3976517)