A branch and bound algorithm with constraint partitioning for integer goal programming problems (Q1141085): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Goal programming and multiple objective optimizations. Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tree-search algorithm for mixed integer programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal maintenance headcount allocation: an application of Chebyshev Goal Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Review of Goal Programming: A Tool for Multiobjective Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Automatic Method of Solving Discrete Programming Problems / rank
 
Normal rank

Latest revision as of 04:19, 13 June 2024

scientific article
Language Label Description Also known as
English
A branch and bound algorithm with constraint partitioning for integer goal programming problems
scientific article

    Statements

    A branch and bound algorithm with constraint partitioning for integer goal programming problems (English)
    0 references
    0 references
    1980
    0 references
    branch and bound algorithm
    0 references
    constraint partitioning
    0 references
    integer goal programming
    0 references
    variable elimination
    0 references
    linear goal programming
    0 references
    partitioning algorithm
    0 references
    multiobjective decision making
    0 references

    Identifiers