Effective anytime algorithm for multiobjective combinatorial optimization problems
From MaRDI portal
Publication:6086280
DOI10.1016/j.ins.2021.02.074zbMath1526.90028OpenAlexW3135084992MaRDI QIDQ6086280
Miguel Ángel Domínguez-Ríos, Enrique Alba, Francisco Chicano
Publication date: 9 November 2023
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2021.02.074
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Parallel partitioning method (PPM): A new exact method to solve bi-objective problems
- A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs
- Multi-objective integer programming: a general approach for generating all non-dominated solutions
- An algorithm for the multiple objective integer linear programming problem
- Computation of ideal and Nadir values and implications for their use in MCDM methods.
- Efficient computation of the search region in multi-objective optimization
- A method for finding the set of non-dominated vectors for multiple objective integer linear programs
- Finding a representative nondominated set for multi-objective mixed integer programs
- Multi-objective integer programming: an improved recursive algorithm
- A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
- Automatically improving the anytime behaviour of optimisation algorithms
- 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 Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme
- An Exact Algorithm for Finding Extreme Supported Nondominated Points of Multiobjective Mixed Integer Programs
- Diversity Maximization Approach for Multiobjective Optimization
- Multicriteria Optimization
This page was built for publication: Effective anytime algorithm for multiobjective combinatorial optimization problems
