A Novel Efficient Approach for Solving the Art Gallery Problem

DOI10.1007/978-3-642-36065-7_3zbMath1355.90043OpenAlexW176852621MaRDI QIDQ4915874

Mahdi Moeini, Alexander Kröller, Christiane Schmidt

Publication date: 12 April 2013

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-36065-7_3

zbMATH Keywords

linear programmingdualityvisibilityseparationart gallery problemDC programming

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Linear programming (90C05)

Related Items (4)

A variable neighborhood search heuristic for the maximum ratio clique problem ⋮ Algorithms for art gallery illumination ⋮ Solving the index tracking problem: a continuous optimization approach ⋮ The Maximum Ratio Clique Problem: A Continuous Optimization Approach and Some New Results

This page was built for publication: A Novel Efficient Approach for Solving the Art Gallery Problem