Approximation algorithm for a class of global optimization problems (Q1937958): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Marco Locatelli / rank
Normal rank
 
Property / author
 
Property / author: Marco Locatelli / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10898-011-9813-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1988893808 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of optimizing over a simplex, hypercube or sphere: a short survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PTAS for the minimization of polynomials of fixed degree over the simplex / rank
 
Normal rank
Property / cites work
 
Property / cites work: A FPTAS for a class of linear multiplicative problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of linear fractional-multiplicative problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Nonlinear Fractional Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some optimal inapproximability results / 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: Semidefinite relaxation and nonconvex quadratic optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and complexity in numerical optimization. Continuous and discrete problems. Conference, Univ. of Florida, Orlando, FL, USA, February 28 - March 2, 1999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for indefinite quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4833803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating quadratic programming with bound and quadratic constraints / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:34, 6 July 2024

scientific article
Language Label Description Also known as
English
Approximation algorithm for a class of global optimization problems
scientific article

    Statements

    Approximation algorithm for a class of global optimization problems (English)
    0 references
    1 February 2013
    0 references
    approximation algorithms
    0 references
    nondecreasing functions
    0 references
    superhomogeneous functions
    0 references
    ratio functions
    0 references
    0 references

    Identifiers