An approach to solving discrete vector optimization problems over a combinatorial set of permutations (Q946788): 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: Solution and investigation of one class of inexact integer programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3487136 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3892061 / rank
 
Normal rank

Latest revision as of 17:41, 28 June 2024

scientific article
Language Label Description Also known as
English
An approach to solving discrete vector optimization problems over a combinatorial set of permutations
scientific article

    Statements

    An approach to solving discrete vector optimization problems over a combinatorial set of permutations (English)
    0 references
    0 references
    0 references
    0 references
    24 September 2008
    0 references
    multi-objective optimization
    0 references
    combinatorial set
    0 references
    set of permutations
    0 references
    Pareto-optimal solution
    0 references

    Identifiers