Computing near-optimal solutions for the dominating subset with minimal weight problem

DOI10.1080/03057920412331272126zbMath1063.65046OpenAlexW2003360411MaRDI QIDQ4652862

Burak Ordin, Urfat G. Nuriyev

Publication date: 28 February 2005

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03057920412331272126

zbMATH Keywords

algorithmglobal optimizationcombinatorial optimizationcutting angle methodassignment problemdominating subset with minimal weightweighted set-covering problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Cites Work

• On complexity of a global optimization problem
• Cutting angle methods in global optimization
• A Greedy Heuristic for the Set-Covering Problem
• Abstract convexity and global optimization

This page was built for publication: Computing near-optimal solutions for the dominating subset with minimal weight problem