Testing optimality for quadratic 0?1 unconstrained problems (Q4859451): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean Elements in Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5538300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods of Nonlinear 0-1 Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3972966 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of local maxima in quadratic 0-1 programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of uniqueness and local search in quadratic 0-1 programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational aspects of a branch and bound algorithm for quadratic zero- one programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank

Latest revision as of 08:01, 24 May 2024

scientific article; zbMATH DE number 829853
Language Label Description Also known as
English
Testing optimality for quadratic 0?1 unconstrained problems
scientific article; zbMATH DE number 829853

    Statements

    Testing optimality for quadratic 0?1 unconstrained problems (English)
    0 references
    0 references
    0 references
    0 references
    7 January 1996
    0 references
    convex analysis
    0 references
    \(\varepsilon\)-subgradient
    0 references
    necessary and sufficient condition
    0 references
    quadratic pseudo-Boolean unconstrained problems
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references