Constructive dual methods for discrete programming (Q1101341): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An Algorithm for Large Zero-One Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bound-improving approach to discrete programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bound improving sequence algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Convergent Duality Theory for Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the solution of the 0-1 knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 37. Algorithm for the solution of the 0-1 single Knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3968756 / rank
 
Normal rank

Latest revision as of 15:55, 18 June 2024

scientific article
Language Label Description Also known as
English
Constructive dual methods for discrete programming
scientific article

    Statements

    Constructive dual methods for discrete programming (English)
    0 references
    0 references
    1987
    0 references
    constructive dual methods
    0 references
    discrete programming
    0 references
    reduction of the feasibility set
    0 references
    no duality gap
    0 references
    relaxation approximation
    0 references
    knapsack problems
    0 references

    Identifiers