A mixed integer formulation for maximal covering by inclined parallelograms

DOI10.1016/S0377-2217(03)00389-8MaRDI QIDQ1876161zbMATH OpenFDO

Authors 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)

Recommendations

• An extended continuous maximal covering location problem with facility placement
• The generalized maximal covering location problem
• scientific article; zbMATH DE number 2125698
• The p-cover problem
• Covering with rectangular pieces

Cites work

• scientific article; zbMATH DE number 44281 (Why is no real title available?)
• scientific article; zbMATH DE number 4123493 (Why is no real title available?)
• scientific article; zbMATH DE number 1253058 (Why is no real title available?)
• A single facility location problem with a weighted maximin-minimax rectilinear distance
• Algorithms for computerized inspection of rectangular and square shapes
• An extended continuous maximal covering location problem with facility placement
• Covering a set of points by two axis-parallel boxes
• Optimal packing and covering in the plane are NP-complete
• Optimal placement of convex polygons to maximize point containment
• Translating a convex polygon to contain a maximum number of points.

Cited in

(3)

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

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

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