Zero duality gap in integer programming: \(P\)-norm surrogate constraint method (Q1807931): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5606006 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surrogate Constraints in Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surrogate Mathematical Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some relationships between lagrangian and surrogate duality in integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Searchability of the Composite and Multiple Surrogate Dual Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero duality gap for a class of nonconvex optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-Convex Programming / rank
 
Normal rank

Latest revision as of 10:37, 29 May 2024

scientific article
Language Label Description Also known as
English
Zero duality gap in integer programming: \(P\)-norm surrogate constraint method
scientific article

    Statements

    Zero duality gap in integer programming: \(P\)-norm surrogate constraint method (English)
    0 references
    24 November 1999
    0 references
    integer programming
    0 references
    surrogate constraint method
    0 references
    duality gap
    0 references
    saddle point
    0 references
    \(p\)-norm surrogate constraint method
    0 references
    0 references

    Identifiers