Efficient methods of multicriterial optimization based on the intensive use of search information
From MaRDI portal
Publication:3133352
DOI10.1007/978-3-319-56829-4_3zbMATH Open1380.90243OpenAlexW2628996211MaRDI QIDQ3133352FDOQ3133352
Authors: Victor P. Gergel, Evgeniy Kozinov 
Publication date: 14 February 2018
Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-56829-4_3
Recommendations
- Efficient multicriterial optimization based on intensive reuse of search information
- An approach for simultaneous finding of multiple efficient decisions in multi-objective optimization problems
- Computationally efficient approach for solving lexicographic multicriteria optimization problems
- An Efficient Interior-Point Method for Convex Multicriteria Optimization Problems
- scientific article; zbMATH DE number 3982928
Cited In (8)
- Computationally efficient approach for solving lexicographic multicriteria optimization problems
- An approach for simultaneous finding of multiple efficient decisions in multi-objective optimization problems
- An accelerated algorithm for finding efficient solutions in multiobjective problems with black-box multiextremal criteria
- Applicability of a truncation algorithm for the solution of multicriteria information search problems
- Generalized parallel computational schemes for time-consuming global optimization
- Guest editors' preface to the special issue devoted to the 2nd international conference ``Numerical computations: theory and algorithms, June 19--25, 2016, Pizzo Calabro, Italy
- Efficient multicriterial optimization based on intensive reuse of search information
- Title not available (Why is that?)
This page was built for publication: Efficient methods of multicriterial optimization based on the intensive use of search information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3133352)
