Determination of minimum number of sensors and their locations for an automated facility: An algorithmic approach

DOI10.1016/0377-2217(92)90028-8zbMath0825.90646OpenAlexW2076997856MaRDI QIDQ1205702

Ram Pandit, Placid M. Ferreira

Publication date: 1 April 1993

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(92)90028-8

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

• A combinatorial theorem in plane geometry
• Visibility of a simple polygon
• Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
• A linear algorithm for computing the visibility polygon from a point
• Note—A Computational Survey of Methods for the Set Covering Problem
• Heuristically aided set-covering algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item