An exact parallel objective space decomposition algorithm for solving multi-objective integer programming problems (Q2274869): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Efficient cuts for generating the non-dominated vectors for Multiple Objective Integer Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs / 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: Efficient computation of the search region in multi-objective optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bound sets for biobjective combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lipschitzian optimization without the Lipschitz constant / 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: An Algorithm for Multiobjective Zero-One Linear Programming / 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: Finding all nondominated points of multi-objective integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for mixed zero-one multiple objective linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming / 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 Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme / 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: 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: Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case / rank
 
Normal rank

Revision as of 13:14, 20 July 2024

scientific article
Language Label Description Also known as
English
An exact parallel objective space decomposition algorithm for solving multi-objective integer programming problems
scientific article

    Statements

    An exact parallel objective space decomposition algorithm for solving multi-objective integer programming problems (English)
    0 references
    0 references
    0 references
    0 references
    1 October 2019
    0 references
    multi-objective
    0 references
    integer programming
    0 references
    parallel computation
    0 references
    algorithm
    0 references
    nondominated set
    0 references
    0 references
    0 references

    Identifiers