scientific article
From MaRDI portal
Publication:3976517
zbMath0735.90044MaRDI QIDQ3976517
Publication date: 26 June 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (10)
A deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy ⋮ Tropicalizing the Simplex Algorithm ⋮ Solving generic nonarchimedean semidefinite programs using stochastic game algorithms ⋮ Computability of validity and satisfiability in probability logics over finite and countable models ⋮ 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 ⋮ A counterexample to the Hirsch conjecture ⋮ Improving Strategies via SMT Solving ⋮ Hybrid-LP: finding advanced starting points for simplex, and pivoting LP methods ⋮ Machine-part cell formation using biclustering
This page was built for publication:
