An FPTAS for optimizing a class of low-rank functions over a polytope (Q378129): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10107-011-0511-x / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2007598971 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jointly Constrained Biconvex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polymatroids and mean-risk minimization in discrete optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplicative programming problems: Analysis and efficient point search heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4830373 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579439 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Non-monotone Submodular Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An FPTAS for minimizing a class of low-rank quasi-concave functions over a convex set / rank
 
Normal rank
Property / cites work
 
Property / cites work: An FPTAS for minimizing the product of two non-negative linear cost functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some optimal inapproximability results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting Planes for Low-Rank-Like Concave Minimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic programming and combinatorial minimum weight product problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane algorithm for solving bilinear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear multiplicative programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization on low rank nonconvex structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting plane/tabu search algorithms for low rank concave quadratic programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithms for a class of minimum rank-two cost path problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682236 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(NP\)-hardness of linear multiplicative programming and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Reliable Stochastic Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic programming with one negative eigenvalue is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional programming: The sum-of-ratios case / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the sum of a linear and linear-fractional function / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new reformulation-linearization technique for bilinear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for indefinite quadratic programming / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10107-011-0511-X / rank
 
Normal rank

Latest revision as of 15:45, 9 December 2024

scientific article
Language Label Description Also known as
English
An FPTAS for optimizing a class of low-rank functions over a polytope
scientific article

    Statements

    An FPTAS for optimizing a class of low-rank functions over a polytope (English)
    0 references
    0 references
    0 references
    11 November 2013
    0 references
    nonconvex optimization
    0 references
    combinatorial optimization
    0 references
    approximation schemes
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references