An approach to the subproblem of the cutting angle method of global optimization
type: Item
instance of: scholarly article
title: An approach to the subproblem of the cutting angle method of global optimization
zbMATH Open document ID: 1093.90048
author: Urfat G. Nuriyev
published in: Journal of Global Optimization
publication date: 2006-02-08T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5005148
zbMATH Keywords: assignment problem
zbMATH Keywords: cutting angle method
zbMATH Keywords: dominant subset with minimal weight problem
zbMATH Keywords: global optimization problem
zbMATH Keywords: heuristic algorithm
zbMATH Keywords: knapsack problem
zbMATH Keywords: NP-complete
MaRDI profile type: Publication
full work available at URL: s10898-004-1687-x
OpenAlex ID: W2010968185
cites work: Cutting angle methods in global optimization
cites work: Global minimization of increasing positively homogeneous functions over the unit simplex
cites work: Cutting angle method and a local search
cites work: Minimizing increasing star-shaped functions based on abstract convexity
cites work: Lipschitz programming via increasing convex-along-rays functions*
DOI: 10.1007/S10898-004-1687-X
Recommended article: An exact method for solving the subproblem of the cutting angle method of global optimization.
Recommended article: Cutting angle methods in global optimization
Recommended article: Cutting angle method – a tool for constrained global optimization
Recommended article: Q5453761
Recommended article: Fast algorithm for the cutting angle method of global optimization
Recommended article: The modified cutting angle method for global minimization of increasing positively homogeneous functions over the unit simplex
Recommended article: Imbedding and cutting methods for global optimization and their applications
Recommended article: Cutting angle method and a local search
Recommended article: A polyhedral branch-and-cut approach to global optimization
Recommended article: On global optimality conditions and cutting plane algorithms
description: scientific article; zbMATH DE number 5005148