An approach to the subproblem of the cutting angle method of global optimization

DOI10.1007/s10898-004-1687-xzbMath1093.90048OpenAlexW2010968185MaRDI QIDQ813345

Urfat G. Nuriyev

Publication date: 8 February 2006

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-004-1687-x

zbMATH Keywords

knapsack problemcutting angle methodheuristic algorithmNP-completeassignment problemdominant subset with minimal weight problemglobal optimization problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)

Related Items (2)

Radiant separation theorems and minimum-type subdifferentials of calm functions ⋮ On the global minimization of increasing positively homogeneous functions over the unit simplex

Cites Work

• Minimizing increasing star-shaped functions based on abstract convexity
• Cutting angle method and a local search
• Cutting angle methods in global optimization
• Lipschitz programming via increasing convex-along-rays functions^*
• Global minimization of increasing positively homogeneous functions over the unit simplex

This page was built for publication: An approach to the subproblem of the cutting angle method of global optimization