A mixed integer formulation for maximal covering by inclined parallelograms

DOI10.1016/S0377-2217(03)00389-8zbMATH Open1067.90111MaRDI QIDQ1876161FDOQ1876161

Authors: Hassan Younies, George O. Wesolowsky 

Publication date: 16 August 2004

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

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

zbMATH Keywords

Integer programmingLocationCoveringParallelograms

Mathematics Subject Classification ID

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

Cites Work

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

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)