scientific article; zbMATH DE number 2111731

MaRDI QIDQ4825540zbMATH OpenFDO

Authors Michael Segal

Publication date 28 October 2004

zbMATH Keywords

range searching

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Continuous location (90B85)

Recommendations

• Location Of A Tree Shaped Facility In A Network
• Location of a facility minimizing nuisance to or from a planar network
• scientific article; zbMATH DE number 4100913
• Obnoxious Facility Location on Graphs
• Obnoxious facility location: complete service with minimal harm

Cited in

(12)

• Computing obnoxious 1-corner polygonal chains
• Obnoxious facility location in multiple dimensional space
• Computing an obnoxious anchored segment.
• Discrete facility location and routing of obnoxious activities.
• Maximizing the number of obnoxious facilities to locate within a bounded region
• Dispersing obnoxious facilities on a graph
• Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem
• Location of a facility minimizing nuisance to or from a planar network
• Location of an undesirable facility in a polygonal region with forbidden zones
• Low complexity algorithms for optimal consumer push-pull partial covering in the plane
• Dispersing Obnoxious Facilities on a Graph
• Locating an obnoxious facility on a euclidean network to minimize neighborhood damage

This page was built for publication:

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