A new upper bound for the 0-1 quadratic knapsack problem (Q1806683): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Linear programming for the \(0-1\) quadratic knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3835301 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Decomposition Method for Quadratic Zero-One Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering and domination in perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Parametric Maximum Flow Algorithm and Applications / 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: Validation of subgradient optimization / 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: Min-cut clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new bound for the quadratic knapsack problem and its use in a branch and bound algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic Binary Programming with Application to Capital-Budgeting Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean methods for the 0-1 quadratic knapsack problem / rank
 
Normal rank

Revision as of 09:59, 29 May 2024

scientific article
Language Label Description Also known as
English
A new upper bound for the 0-1 quadratic knapsack problem
scientific article

    Statements

    A new upper bound for the 0-1 quadratic knapsack problem (English)
    0 references
    0 references
    0 references
    0 references
    8 November 1999
    0 references
    quadratic programming
    0 references
    0-1 quadratic knapsack problem
    0 references
    quadratic pseudo-Boolean function
    0 references
    Lagrangian decomposition
    0 references
    upper bound
    0 references
    computational experiments
    0 references

    Identifiers