Split algorithms for multiobjective integer programming problems
From MaRDI portal
Publication:2669784
DOI10.1016/j.cor.2021.105673OpenAlexW4200282861MaRDI QIDQ2669784
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
multiobjective discrete optimizationweighted sum scalarizationmultiobjective integer programmingPascoletti-Serafini scalarizationepsilon constraint scalarization
Cites Work
- The \(L\)-shape search method for triobjective integer programming
- On the representation of the search region in multi-objective optimization
- Finding all nondominated points of multi-objective integer programs
- A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
- Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations
- Bound sets for biobjective combinatorial optimization problems
- Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
- Efficient computation of the search region in multi-objective optimization
- The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs
- A new method for optimizing a linear function over the efficient set of a multiobjective integer program
- A method for finding the set of non-dominated vectors for multiple objective integer linear programs
- Scalarizing vector optimization problems
- Finding a representative nondominated set for multi-objective mixed integer programs
- Distribution based representative sets for multi-objective integer programs
- Multi-objective integer programming: an improved recursive algorithm
- A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
- An exact parallel objective space decomposition algorithm for solving multi-objective integer programming 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
- An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
- A decision space algorithm for multiobjective convex quadratic integer optimization
- A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem
- Diversity Maximization Approach for Multiobjective Optimization
- Adaptive Scalarization Methods in Multiobjective Optimization
- Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems
- Disjunctive Programming for Multiobjective Discrete Optimisation
This page was built for publication: Split algorithms for multiobjective integer programming problems
