Approximation algorithms for discrete polynomial optimization (Q384206): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s40305-013-0003-1 / rank
Normal rank
 
Property / author
 
Property / author: Shu-Zhong Zhang / rank
Normal rank
 
Property / author
 
Property / author: Shu-Zhong Zhang / 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/s40305-013-0003-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2163718799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a System of Linear Diophantine Equations with Lower and Upper Bounds on the Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Cut-Norm via Grothendieck's Inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random sampling and approximation of MAX-CSP problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notes—On a Selection Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster algorithms for Frobenius numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247459 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neural networks, error-correcting codes, and polynomials over the binary n-cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum Block Improvement and Polynomial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840366 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing More Unsatisfiable Random <i>k</i>-SAT Instances Efficiently / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quick approximation to matrices and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: Q5538300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods of Nonlinear 0-1 Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for homogeneous polynomial optimization with quadratic constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: ``Neural'' computation of decisions in optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for indefinite complex quadratic maximization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral methods for matrices and tensors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Best Rank-1 Approximation of Higher-Order Supersymmetric Tensors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite relaxation and nonconvex quadratic optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4331818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Selection Problem of Shared Fixed Costs and Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S40305-013-0003-1 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:58, 9 December 2024

scientific article
Language Label Description Also known as
English
Approximation algorithms for discrete polynomial optimization
scientific article

    Statements

    Approximation algorithms for discrete polynomial optimization (English)
    0 references
    0 references
    0 references
    0 references
    27 November 2013
    0 references
    polynomial optimization problem
    0 references
    binary integer programming
    0 references
    mixed integer programming
    0 references
    approximation algorithm
    0 references
    approximation ratio
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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