An FPTAS for optimizing a class of low-rank functions over a polytope
From MaRDI portal
Recommendations
- An FPTAS for minimizing a class of low-rank quasi-concave functions over a convex set
- FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension
- A FPTAS for a class of linear multiplicative problems
- An FPTAS for minimizing indefinite quadratic forms over integers in polyhedra
- An FPTAS for minimizing the product of two non-negative linear cost functions
Cites work
- scientific article; zbMATH DE number 5764846 (Why is no real title available?)
- scientific article; zbMATH DE number 3904328 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 2121575 (Why is no real title available?)
- A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One
- A cutting plane algorithm for solving bilinear programs
- A new reformulation-linearization technique for bilinear programming problems
- A note on the sum of a linear and linear-fractional function
- An FPTAS for minimizing a class of low-rank quasi-concave functions over a convex set
- An FPTAS for minimizing the product of two non-negative linear cost functions
- Approximation algorithms for indefinite quadratic programming
- Approximation algorithms for reliable stochastic combinatorial optimization
- Cutting Planes for Low-Rank-Like Concave Minimization Problems
- Cutting plane/tabu search algorithms for low rank concave quadratic programming problems
- Fractional programming: The sum-of-ratios case
- Geometric algorithms and combinatorial optimization
- Handbook of global optimization
- Jointly Constrained Biconvex Programming
- Linear multiplicative programming
- Maximizing Non-monotone Submodular Functions
- Multiplicative programming problems: Analysis and efficient point search heuristic
- Optimization on low rank nonconvex structures
- Polymatroids and mean-risk minimization in discrete optimization
- Polynomial algorithms for a class of minimum rank-two cost path problems
- Quadratic programming and combinatorial minimum weight product problems
- Quadratic programming with one negative eigenvalue is NP-hard
- Some optimal inapproximability results
- \(NP\)-hardness of linear multiplicative programming and related problems
Cited in
(23)- Maximizing a class of utility functions over the vertices of a polytope
- The Rank-One Quadratic Assignment Problem
- A PTAS for a class of binary non-linear programs with low-rank functions
- A characterization of linearizable instances of the quadratic minimum spanning tree problem
- Combinatorial optimization with interaction costs: complexity and solvable cases
- Graph cuts with interacting edge weights: examples, approximations, and algorithms
- (Global) optimization: historical notes and recent developments
- On the tightness of an LP relaxation for rational optimization and its applications
- Linear decomposition approach for a class of nonconvex programming problems
- Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints
- Efficient local search procedures for quadratic fractional programming problems
- Reference points and approximation algorithms in multicriteria discrete optimization
- Fast heuristics and approximation algorithms
- The bilinear assignment problem: complexity and polynomially solvable special cases
- A vector linear programming approach for certain global optimization problems
- An FPTAS for minimizing indefinite quadratic forms over integers in polyhedra
- An FPTAS for a general class of parametric optimization problems
- Range division and linearization algorithm for a class of linear ratios optimization problems
- FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension
- Solving a class of generalized fractional programming problems using the feasibility of linear programs
- An FPTAS for minimizing a class of low-rank quasi-concave functions over a convex set
- A normal fan projection algorithm for low-rank optimization
- An \(\varepsilon\)-approximation algorithm for generalized fractional programming problems
This page was built for publication: An FPTAS for optimizing a class of low-rank functions over a polytope
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q378129)
