A mixed integer formulation for maximal covering by inclined parallelograms

DOI10.1016/S0377-2217(03)00389-8zbMath1067.90111MaRDI QIDQ1876161

Hassan Younies, George O. Wesolowsky

Publication date: 16 August 2004

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

zbMATH Keywords

Integer programmingLocationCoveringParallelograms

Mathematics Subject Classification ID

Integer programming (90C10) Discrete location and assignment (90B80)

Related Items (3)

A mean-shift algorithm for large-scale planar maximal covering location problems ⋮ A practical heuristic for maximum coverage in large-scale continuous location problem ⋮ Planar expropriation problem with non-rigid rectangular facilities

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Covering a set of points by two axis-parallel boxes
• A single facility location problem with a weighted maximin-minimax rectilinear distance
• An extended continuous maximal covering location problem with facility placement
• Optimal packing and covering in the plane are NP-complete
• Optimal placement of convex polygons to maximize point containment
• Algorithms for computerized inspection of rectangular and square shapes
• Translating a convex polygon to contain a maximum number of points.

This page was built for publication: A mixed integer formulation for maximal covering by inclined parallelograms