A polyhedral approach to solving multicriterion combinatorial optimization problems over sets of polyarrangements (Q1040407): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4745600 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4880741 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence of solutions in vector optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4455572 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability of vector problems of integer optimization: relationship with the stability of sets of optimal and nonoptimal solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approach to solving discrete vector optimization problems over a combinatorial set of permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4518696 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral techniques in combinatorial optimization I: Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral techniques in combinatorial optimization II: applications and computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5191744 / rank
 
Normal rank

Latest revision as of 05:51, 2 July 2024

scientific article
Language Label Description Also known as
English
A polyhedral approach to solving multicriterion combinatorial optimization problems over sets of polyarrangements
scientific article

    Statements

    A polyhedral approach to solving multicriterion combinatorial optimization problems over sets of polyarrangements (English)
    0 references
    0 references
    0 references
    24 November 2009
    0 references
    multicriterion optimization
    0 references
    discrete optimization
    0 references
    combinatorial sets
    0 references
    polyarrangements
    0 references
    Pareto-optimal solutions
    0 references
    weakly and strongly efficient solutions
    0 references

    Identifiers