A branch and bound algorithm for designing reliable systems at a minimum cost (Q5931708): Difference between revisions

From MaRDI portal
Added link to MaRDI 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: Q3999921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear 0–1 programming: I. Linearization techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: An enumerative algorithm framework for a class of nonlinear integer programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995331 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3730896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear Integer Goal Programming Applied to Optimal System Reliability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Reliability Allocation by Branch-and-Bound Technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3932565 / rank
 
Normal rank

Latest revision as of 16:40, 3 June 2024

scientific article; zbMATH DE number 1591701
Language Label Description Also known as
English
A branch and bound algorithm for designing reliable systems at a minimum cost
scientific article; zbMATH DE number 1591701

    Statements

    A branch and bound algorithm for designing reliable systems at a minimum cost (English)
    0 references
    0 references
    0 references
    25 April 2001
    0 references
    0 references
    reliability
    0 references
    nonlinear integer programming
    0 references