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

DOI10.1080/03057920412331272126MaRDI QIDQ4652862zbMATH OpenOpenAlexFDO

Authors Urfat G. Nuriyev, Burak Ordin

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

algorithmassignment problemcombinatorial optimizationcutting angle methoddominating subset with minimal weightglobal optimizationweighted set-covering problem

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 5990006
• An approach to the subproblem of the cutting angle method of global optimization
• Minmax combinatorial optimization
• On complexity of a global optimization problem
• A new dominance procedure for combinatorial optimization problems

Cites work

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

Cited in

(1)

• scientific article; zbMATH DE number 5990006 (Why is no real title available?)

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

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