scientific article; zbMATH DE number 2111731

zbMATH Open1094.90049MaRDI QIDQ4825540FDOQ4825540

Authors: Michael Segal 

Publication date: 28 October 2004

Title of this publication is not available (Why is that?)

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

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)

Cited In (12)

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

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)