A branch and bound algorithm for Holder bi-objective optimization. Implementation to multidimensional optimization
type: Item
instance of: scholarly article
title: A branch and bound algorithm for Holder bi-objective optimization. Implementation to multidimensional optimization
author: Hamadi Ammar
author: Bechir Naffeti
published in: Mathematics and Computers in Simulation
publication date: 2022-11-17T00:00:00Z
Mathematics Subject Classification ID: 65-XX
Mathematics Subject Classification ID: 90-XX
zbMATH DE Number: 7619056
zbMATH Keywords: optimization algorithms
zbMATH Keywords: bi-objective optimization
zbMATH Keywords: branch and bound methods
zbMATH Keywords: trisection methods
zbMATH Keywords: Holder functions
zbMATH Keywords: Pareto front
zbMATH Keywords: Alienor technical
Wikidata QID: Q113869114
MaRDI profile type: Publication
full work available at URL: j.matcom.2022.08.003
OpenAlex ID: W4292319852
cites work: Stochastic global optimization using tangent minorants for Lipschitz functions
cites work: Multiobjective optimization. Interactive and evolutionary approaches
cites work: Pareto optimality in multiobjective problems
cites work: Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
cites work: Multi-objective optimization using evolutionary algorithms
cites work: Nonuniform covering method as applied to multicriteria optimization problems with guaranteed accuracy
cites work: Global optimization of Hölder functions
cites work: Introduction to global optimization.
cites work: Nonlinear multiobjective optimization
cites work: A new trisection method for solving Lipschitz bi-objective optimization problems
cites work: Pareto set approximation by the method of adjustable weights and successive lexicographic goal programming
cites work: An algorithm for finding the absolute extremum of a function
cites work: On the worst-case optimal multi-objective global optimization
cites work: A one-step worst-case optimal algorithm for bi-objective univariate optimization
cites work: On one-step worst-case optimal trisection in univariate bi-objective Lipschitz optimization
cites work: Adaptation of a one-step worst-case optimal univariate algorithm of bi-objective Lipschitz optimization to multidimensional problems
DOI: 10.1016/J.MATCOM.2022.08.003
description: scientific article; zbMATH DE number 7619056