Nonlinear 0–1 programming: II. Dominance relations and algorithms (Q3216431): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Facets of the knapsack polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Canonical Cuts on the Unit Hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pivot and Complement–A Heuristic for 0-1 Programming / 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: Modular Design—A Special Case in Nonlinear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Generalized Covering Relaxation for 0-1 Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering Relaxation for Positive 0-1 Polynomial Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An accelerated covering relaxation algorithm for solving 0–1 positive polynomial programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5538300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for Vision Loss in Glaucoma Suspects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capital Expenditure Programming and Some Alternative Approaches to Risk / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster Analysis and Mathematical Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Balasian-Based Algorithm for Zero-One Polynomial Programming / rank
 
Normal rank

Revision as of 15:22, 14 June 2024

scientific article
Language Label Description Also known as
English
Nonlinear 0–1 programming: II. Dominance relations and algorithms
scientific article

    Statements

    Nonlinear 0–1 programming: II. Dominance relations and algorithms (English)
    0 references
    0 references
    0 references
    1984
    0 references
    nonlinear 0-1 programming algorithm
    0 references
    compact linear equivalent
    0 references
    strengthening 0-1 inequalities
    0 references
    linearization
    0 references
    multilinear 0-1 program
    0 references
    generalized covering inequalities
    0 references
    dominance
    0 references
    computational experience
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references