An approximation algorithm for a general class of parametric optimization problems
DOI10.1007/S10878-020-00646-5zbMATH Open1497.90199OpenAlexW3087954410MaRDI QIDQ2156299FDOQ2156299
Authors: Cristina Bazgan, Arne Herzel, Stefan Ruzika, Clemens Thielen, Daniel Vanderpooten 
Publication date: 18 July 2022
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-020-00646-5
Recommendations
- An approximation algorithm for a general class of multi-parametric optimization problems
- Approximation methods for multiobjective and parametric optimization problems
- A Theory on Extending Algorithms for Parametric Problems
- Approximation schemes for the parametric knapsack problem
- An efficient, strongly polynomial, \(\varepsilon\)-approximation parametric optimization scheme
approximation algorithmparametric optimizationparametric assignment problemparametric metric TSPparametric minimum cost flow problemparametric shortest path problem
Cites Work
- Network flows. Theory, algorithms, and applications.
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Stochastic Shortest Paths Via Quasi-convex Maximization
- A fast parametric assignment algorithm with applications in max-algebra
- Max-Balancing Weighted Directed Graphs and Matrix Scaling
- A Fast Parametric Maximum Flow Algorithm and Applications
- Worst-case analysis of a new heuristic for the travelling salesman problem
- The Traveling Salesman Problem with Distances One and Two
- Complexity of some parametric integer and network programming problems
- A lower bound for the shortest path problem
- Parametric mixed-integer 0-1 linear programming: The general case for a single parameter
- Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
- Combinatorial optimization. Networks and matroids
- Complexity results for multicriterial and parametric network flows using a pathological graph of Zadeh
- Title not available (Why is that?)
- Title not available (Why is that?)
- Faster parametric shortest path and minimum‐balance algorithms
- Computational complexity of parametric linear programming
- Parametric shortest path algorithms with an application to cyclic staffing
- Generalization of a theorem on the parametric maximum flow problem
- A note on the parametric maximum flow problem and some related reoptimization issues
- Fast Algorithms for Parametric Scheduling Come From Extensions to Parametric Maximum Flow
- Approximation schemes for the parametric knapsack problem
- An FPTAS for the parametric knapsack problem
- Computing optimal scalings by parametric network algorithms
- A minimum concave-cost dynamic network flow problem with an application to lot-sizing
- How good is the Chord algorithm?
- An FPTAS for the knapsack problem with parametric weights
- An FPTAS for a general class of parametric optimization problems
Cited In (14)
- An efficient, strongly polynomial, \(\varepsilon\)-approximation parametric optimization scheme
- Title not available (Why is that?)
- A Theory on Extending Algorithms for Parametric Problems
- Title not available (Why is that?)
- Approximate parametric searching
- Finite \(\varepsilon\)-subgradient algorithm for approximate solution of the parametric programming problem
- An FPTAS for a general class of parametric optimization problems
- Approximation of the optimum function in procedures of parametric optimization
- Parameterized Approximation Problems
- An approximation algorithm for a general class of multi-parametric optimization problems
- Approximating parameterized convex optimization problems
- Approximating parameterized convex optimization problems
- Max-max, max-min, min-max and min-min knapsack problems with a parametric constraint
- Parametric matroid interdiction
This page was built for publication: An approximation algorithm for a general class of parametric optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2156299)
