Cooperative multiobjective optimization with bounds on objective functions
From MaRDI portal
Publication:2022239
DOI10.1007/S10898-020-00946-4zbMATH Open1465.90093OpenAlexW3089146011MaRDI QIDQ2022239FDOQ2022239
Authors: Ignacy Kaliszewski, Janusz Miroforidis
Publication date: 28 April 2021
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-020-00946-4
Recommendations
- On upper approximations of Pareto fronts
- scientific article; zbMATH DE number 1784662
- Interactive multiple criteria decision making for large-scale multi-objective optimization problems
- Interactive multiple criteria decision making for large-scale multi-objective optimization problems
- Bound sets for biobjective combinatorial optimization problems
Cites Work
- Nonlinear multiobjective optimization
- Title not available (Why is that?)
- Metaheuristics. From design to implementation.
- Multicriteria Optimization
- Multi-objective optimization using evolutionary algorithms
- Title not available (Why is that?)
- Approximation methods in multiobjective programming
- Interactive multiple criteria decision making based on preference driven evolutionary multiobjective optimization with controllable accuracy
- Applications of Multi-Objective Evolutionary Algorithms
- Bound sets for biobjective combinatorial optimization problems
- A genetic algorithm for the multidimensional knapsack problem
- Evolutionary multi-criterion optimization. 6th international conference, EMO 2011, Ouro Preto, Brazil, April 5--8, 2011. Proceedings
- Multiobjective evolutionary algorithms and applications.
- PAINT: Pareto front interpolation for nonlinear multiobjective optimization
- Evolutionary algorithms for single and multicriteria design optimization
- Soft computing for complex multiple criteria decision making
- Two-sided Pareto front approximations
- Multiple criteria decision making by multiobjective optimization. A toolbox
- Decomposition of the problem of approximating the Edgeworth-Pareto hull
- An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: a computational study and comparison with meta-heuristics
- On upper approximations of Pareto fronts
Cited In (2)
Uses Software
This page was built for publication: Cooperative multiobjective optimization with bounds on objective functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2022239)