A Theory on Extending Algorithms for Parametric Problems
From MaRDI portal
Recommendations
- An approximation algorithm for a general class of parametric optimization problems
- A sequential algorithm for finding the solution of the parametric minimum flow problem
- scientific article; zbMATH DE number 1273648
- Algorithmic solution of two parametric optimization problems of a set of complete combinations
- A Fast Parametric Maximum Flow Algorithm and Applications
Cited in
(13)- Dines-Fourier-Motzkin quantifier elimination and an application of corresponding transfer principles over ordered fields
- Formulation of linear problems and solution by a universal machine
- An asymptotic simplex method for singularly perturbed linear programs
- Perron-Frobenius theory over real closed fields and fractional power series expansions
- An approximation algorithm for a general class of parametric optimization problems
- An algorithm for computing maximum solution bases
- Generating approximate parametric roots of parametric polynomials
- scientific article; zbMATH DE number 5168299 (Why is no real title available?)
- An exact correspondence of linear problems and randomizing linear algorithms
- Faster exact algorithms for hard problems: A parameterized point of view
- Nonnegative ranks, decompositions, and factorizations of nonnegative matrices
- Computing uniformly optimal strategies in two-player stochastic games
- Gröbner bases in asymptotic analysis of perturbed polynomial programs
This page was built for publication: A Theory on Extending Algorithms for Parametric Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3827805)
