Theory and algorithms for linear multiple objective programs with zero–one variables (Q3853460): 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: Linear multiple objective programs with zero–one variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding all efficient extreme points for multiple objective linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A revised simplex method for linear multiple objective programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5589748 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3214697 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the vector maximization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: The set of all nondominated solutions in linear cases and a multicriteria simplex method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying Efficient Vectors: Some Theory and Computational Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138487 / rank
 
Normal rank

Latest revision as of 03:36, 13 June 2024

scientific article
Language Label Description Also known as
English
Theory and algorithms for linear multiple objective programs with zero–one variables
scientific article

    Statements

    Theory and algorithms for linear multiple objective programs with zero–one variables (English)
    0 references
    0 references
    0 references
    1979
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    multi-criteria optimization
    0 references
    integer programming
    0 references
    boolean programming
    0 references
    vector optimization
    0 references
    strong efficient points
    0 references
    weak efficient points
    0 references
    computational results
    0 references
    algorithm
    0 references
    interval linear multiple zero-one programming
    0 references