An FPTAS for optimizing a class of low-rank functions over a polytope
From MaRDI portal
Publication:378129
DOI10.1007/S10107-011-0511-XzbMATH Open1280.90096OpenAlexW2007598971MaRDI QIDQ378129FDOQ378129
Andreas S. Schulz, Shashi Mittal
Publication date: 11 November 2013
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/76278
Quadratic programming (90C20) Multi-objective and goal programming (90C29) Nonconvex programming, global optimization (90C26) Combinatorial optimization (90C27)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Geometric algorithms and combinatorial optimization
- Handbook of global optimization
- Fractional programming: The sum-of-ratios case
- Some optimal inapproximability results
- A new reformulation-linearization technique for bilinear programming problems
- Jointly Constrained Biconvex Programming
- Approximation algorithms for indefinite quadratic programming
- Quadratic programming with one negative eigenvalue is NP-hard
- Linear multiplicative programming
- Multiplicative programming problems: Analysis and efficient point search heuristic
- \(NP\)-hardness of linear multiplicative programming and related problems
- Approximation Algorithms for Reliable Stochastic Combinatorial Optimization
- A note on the sum of a linear and linear-fractional function
- A cutting plane algorithm for solving bilinear programs
- Optimization on low rank nonconvex structures
- Cutting plane/tabu search algorithms for low rank concave quadratic programming problems
- Polynomial algorithms for a class of minimum rank-two cost path problems
- An FPTAS for minimizing a class of low-rank quasi-concave functions over a convex set
- Maximizing Non-monotone Submodular Functions
- A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One
- Cutting Planes for Low-Rank-Like Concave Minimization Problems
- An FPTAS for minimizing the product of two non-negative linear cost functions
- Polymatroids and mean-risk minimization in discrete optimization
- Quadratic programming and combinatorial minimum weight product problems
Cited In (19)
- The Rank-One Quadratic Assignment Problem
- Efficient local search procedures for quadratic fractional programming problems
- Fast Heuristics and Approximation Algorithms
- Title not available (Why is that?)
- A characterization of linearizable instances of the quadratic minimum spanning tree problem
- A vector linear programming approach for certain global optimization problems
- Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints
- Graph cuts with interacting edge weights: examples, approximations, and algorithms
- Linear decomposition approach for a class of nonconvex programming problems
- An FPTAS for a general class of parametric optimization problems
- Solving a class of generalized fractional programming problems using the feasibility of linear programs
- On the tightness of an LP relaxation for rational optimization and its applications
- A PTAS for a class of binary non-linear programs with low-rank functions
- The bilinear assignment problem: complexity and polynomially solvable special cases
- Combinatorial optimization with interaction costs: complexity and solvable cases
- A normal fan projection algorithm for low-rank optimization
- (Global) optimization: historical notes and recent developments
- Reference points and approximation algorithms in multicriteria discrete optimization
- Range division and linearization algorithm for a class of linear ratios optimization 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)
