On Approximation Algorithms for Concave Mixed-Integer Quadratic Programming (Q3186487): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q2743964 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On integer points in polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chvátal closures for mixed integer programming problems / 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: Mixed-integer quadratic programming is in NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4833806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of integer quasiconvex polynomial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new Lenstra-type algorithm for quasiconvex polynomial integer minimization with complexity \(2^{O(n\log n)}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on the complexity of the mixed-integer hull of a polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3050157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming with a Fixed Number of Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of optimal solutions to integer and mixed-integer programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some NP-complete problems in quadratic and nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained global optimization: algorithms and applications / 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: Global minimization of large-scale constrained concave quadratic problems by separable programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computationally Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic programming is in NP / rank
 
Normal rank

Latest revision as of 10:03, 12 July 2024

scientific article
Language Label Description Also known as
English
On Approximation Algorithms for Concave Mixed-Integer Quadratic Programming
scientific article

    Statements

    On Approximation Algorithms for Concave Mixed-Integer Quadratic Programming (English)
    0 references
    0 references
    10 August 2016
    0 references
    0 references
    0 references
    0 references