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

DOI10.1007/S10898-004-1687-XMaRDI QIDQ813345zbMATH OpenOpenAlexFDO

Authors 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

assignment problemknapsack problemheuristic algorithmNP-completecutting angle methoddominant subset with minimal weight problemglobal optimization problem

Mathematics Subject Classification ID

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

Recommendations

• An exact method for solving the subproblem of the cutting angle method of global optimization.
• Cutting angle methods in global optimization
• Cutting angle method – a tool for constrained global optimization
• Extended cutting angle method of global optimization
• Fast algorithm for the cutting angle method of global optimization
• The modified cutting angle method for global minimization of increasing positively homogeneous functions over the unit simplex
• Imbedding and cutting methods for global optimization and their applications
• Cutting angle method and a local search
• A polyhedral branch-and-cut approach to global optimization
• On global optimality conditions and cutting plane algorithms

Cites work

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

Cited in

(8)

• Computing near-optimal solutions for the dominating subset with minimal weight problem
• On the global minimization of increasing positively homogeneous functions over the unit simplex
• The modified cutting angle method for global minimization of increasing positively homogeneous functions over the unit simplex
• Radiant separation theorems and minimum-type subdifferentials of calm functions
• scientific article; zbMATH DE number 2068028 (Why is no real title available?)
• Cutting angle methods in global optimization
• Fast algorithm for the cutting angle method of global optimization
• An exact method for solving the subproblem of the cutting angle method of global optimization.

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q813345)