Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds
type: Item
instance of: scholarly article
title: Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds
zbMATH Open document ID: 1189.90203
author: Remigijus Paulavičius
author: Andreas Grothey
author: Julius Žilinskas
published in: Optimization Letters
publication date: 2010-05-03T00:00:00Z
full work available at URL: Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds.pdf
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 5703321
zbMATH Keywords: global optimization
zbMATH Keywords: branch and bound
zbMATH Keywords: selection strategies
zbMATH Keywords: Lipschitz optimization
zbMATH Keywords: parallel branch and bound
MaRDI profile type: Publication
OpenAlex ID: W2061911928
cites work: Q3374108
cites work: Parallel scientific computing and optimization. Advances and applications
cites work: Generalized subinterval selection criteria for interval global optimization
cites work: Probabilistic subproblem selection in branch-and-bound algorithms
cites work: Solving combinatorial optimization problems in parallel: methods and techniques
cites work: Q4833810
cites work: Introduction to global optimization
cites work: Q4295107
cites work: Theoretical justification of a heuristic subbox selection criterion for interval global optimization
cites work: Parallel computing in optimization. Nordic Summer School, Linköping, Sweden, August 1995
cites work: IMPROVED LIPSCHITZ BOUNDS WITH THE FIRST NORM FOR FUNCTION VALUES OVER MULTIDIMENSIONAL SIMPLEX
cites work: Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
cites work: Global optimization based on a statistical model and simplicial partitioning.
cites work: Branch and bound algorithm for multidimensional scaling with city-block metric
cites work: P-algorithm based on a simplicial statistical model of multimodal functions
cites work: BRANCH AND BOUND WITH SIMPLICIAL PARTITIONS FOR GLOBAL OPTIMIZATION
DOI: 10.1007/S11590-009-0156-3
description: scientific article; zbMATH DE number 5703321