Pages that link to "Item:Q2156299"
From MaRDI portal
The following pages link to An approximation algorithm for a general class of parametric optimization problems (Q2156299):
Displaying 13 items.
- An efficient, strongly polynomial, \(\varepsilon\)-approximation parametric optimization scheme (Q290269) (← links)
- Approximation schemes for the parametric knapsack problem (Q506160) (← links)
- Finite \(\varepsilon\)-subgradient algorithm for approximate solution of the parametric programming problem (Q684974) (← links)
- Approximate parametric searching (Q685496) (← links)
- Approximation of the optimum function in procedures of parametric optimization (Q1320842) (← links)
- An approximation algorithm for a general class of multi-parametric optimization problems (Q2082173) (← links)
- An FPTAS for a general class of parametric optimization problems (Q2300026) (← links)
- Approximating parameterized convex optimization problems (Q2933639) (← links)
- Parameterized Approximation Problems (Q3499730) (← links)
- A Theory on Extending Algorithms for Parametric Problems (Q3827805) (← links)
- (Q4279472) (← links)
- Max-max, max-min, min-max and min-min knapsack problems with a parametric constraint (Q6097849) (← links)
- Parametric matroid interdiction (Q6122085) (← links)