An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem (Q703909): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Eric Soutif / rank
Normal rank
 
Property / author
 
Property / author: Eric Soutif / rank
 
Normal rank
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 / cites work
 
Property / cites work: Linear programming for the \(0-1\) quadratic knapsack problem / 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: 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: A Decomposition Method for Quadratic Zero-One Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic knapsack problems / 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: Lagrangean methods for the 0-1 quadratic knapsack problem / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0377-2217(03)00244-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2024911991 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:52, 30 July 2024

scientific article
Language Label Description Also known as
English
An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
scientific article

    Statements

    An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem (English)
    0 references
    0 references
    0 references
    12 January 2005
    0 references
    0--1 quadratic programming
    0 references
    Knapsack
    0 references
    Lagrangian decomposition
    0 references
    Branch-and-bound
    0 references
    Computational results
    0 references

    Identifiers