On reduction of duality gap in quadratic knapsack problems (Q693132): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Knapsack / 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-012-9872-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2090620760 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57445437 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial case of unconstrained zero-one quadratic optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reverse search for enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new upper bound for the 0-1 quadratic knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Solution of the Quadratic Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3835301 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the stability of a dual weak vector variational inequality problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the supermodular knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solutions and optimality criteria for nonconvex constrained global optimization problems with connections between canonical and Lagrangian duality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Methods For Solving Quadratic 0–1 Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A semidefinite programming approach to the quadratic knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5292090 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean methods for the 0-1 quadratic knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quadratic knapsack problem -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4719331 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global extremal conditions for multi-integer quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facing up to arrangements: face-count formulas for partitions of space by hyperplanes / rank
 
Normal rank

Latest revision as of 23:55, 5 July 2024

scientific article
Language Label Description Also known as
English
On reduction of duality gap in quadratic knapsack problems
scientific article

    Statements

    On reduction of duality gap in quadratic knapsack problems (English)
    0 references
    7 December 2012
    0 references
    quadratic knapsack problem
    0 references
    Lagrangian relaxation
    0 references
    SDP relaxation
    0 references
    duality gap
    0 references
    cell enumeration
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers