An approach to the subproblem of the cutting angle method of global optimization
From MaRDI portal
Publication:813345
DOI10.1007/s10898-004-1687-xzbMath1093.90048MaRDI QIDQ813345
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
knapsack problem; cutting angle method; heuristic algorithm; NP-complete; assignment problem; dominant subset with minimal weight problem; global optimization problem
68Q25: Analysis of algorithms and problem complexity
65K05: Numerical mathematical programming methods
90C60: Abstract computational complexity for mathematical programming problems
90C27: Combinatorial optimization
Related Items
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