Split algorithms for multiobjective integer programming problems

DOI10.1016/J.COR.2021.105673OpenAlexW4200282861MaRDI QIDQ2669784FDOQ2669784

Authors: Özlem Karsu, Firdevs Ulus 

Publication date: 9 March 2022

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2021.105673

Recommendations

• An exact algorithm for biobjective integer programming problems
• A criterion space search algorithm for biobjective mixed integer programming: the triangle splitting method
• Finding all nondominated points of multi-objective integer programs
• The triangle splitting method for biobjective mixed integer programming
• An exact parallel objective space decomposition algorithm for solving multi-objective integer programming problems

zbMATH Keywords

multiobjective discrete optimizationweighted sum scalarizationmultiobjective integer programmingPascoletti-Serafini scalarizationepsilon constraint scalarization

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Multi-objective integer programming: an improved recursive algorithm
• Scalarizing vector optimization problems
• Diversity Maximization Approach for Multiobjective Optimization
• Adaptive Scalarization Methods in Multiobjective Optimization
• An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
• A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
• Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
• A method for finding the set of non-dominated vectors for multiple objective integer linear programs
• A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
• A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems
• \(K\)-PPM: a new exact method to solve multi-objective combinatorial optimization problems
• The \(L\)-shape search method for triobjective integer programming
• Finding all nondominated points of multi-objective integer programs
• Bound sets for biobjective combinatorial optimization problems
• A generic branch-and-cut algorithm for multiobjective optimization problems: application to the multilabel traveling salesman problem
• On the representation of the search region in multi-objective optimization
• Disjunctive Programming for Multiobjective Discrete Optimisation
• The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs
• Efficient computation of the search region in multi-objective optimization
• Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations
• Finding a representative nondominated set for multi-objective mixed integer programs
• An exact parallel objective space decomposition algorithm for solving multi-objective integer programming problems
• A new method for optimizing a linear function over the efficient set of a multiobjective integer program
• A decision space algorithm for multiobjective convex quadratic integer optimization
• Distribution based representative sets for multi-objective integer programs
• Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems

Cited In (1)

• Splitting for multi-objective optimization

This page was built for publication: Split algorithms for multiobjective integer programming problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2669784)