Lagrangean methods for 0-1 quadratic problems (Q1803678): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3932576 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3960718 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean decomposition: A model yielding stronger lagrangean bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods of Nonlinear 0-1 Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean decomposition for integer nonlinear programming with linear constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cuts and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problème de la bipartition minimale d'un graphe / rank
 
Normal rank

Latest revision as of 17:53, 17 May 2024

scientific article
Language Label Description Also known as
English
Lagrangean methods for 0-1 quadratic problems
scientific article

    Statements

    Lagrangean methods for 0-1 quadratic problems (English)
    0 references
    29 June 1993
    0 references
    0 references
    Lagrangean methods
    0 references
    0-1 quadratic programming
    0 references