Efficient computation of the search region in multi-objective optimization (Q1753505): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Bicriteria Transportation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Voronoi diagrams in higher dimensions under certain polyhedral distance functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bringing Order to Special Cases of Klee’s Measure Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the bi-criterion integer programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(K\)-PPM: a new exact method to solve multi-objective combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Colored Orthogonal Range Counting / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the representation of the search region in multi-objective optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the multiple objective integer linear programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-objective integer programming: an improved recursive algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved algorithm for solving biobjective integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method for finding the set of non-dominated vectors for multiple objective integer linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating the Set of Non-dominated Vectors in Multiple Objective Integer Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4889471 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria integer programming: A (hybrid) dynamic programming recursive approach / rank
 
Normal rank

Latest revision as of 17:13, 15 July 2024

scientific article
Language Label Description Also known as
English
Efficient computation of the search region in multi-objective optimization
scientific article

    Statements

    Efficient computation of the search region in multi-objective optimization (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 May 2018
    0 references
    multi-objective optimization
    0 references
    nondominated set
    0 references
    search region
    0 references
    local upper bounds
    0 references
    scalarization
    0 references
    0 references

    Identifiers