Pages that link to "Item:Q5689812"

The following pages link to Minimum covering criterion for obnoxious facility location on a network (Q5689812):

Displaying 12 items.

• Covering part of a planar network (Q291695) (← links)
• Maximizing the number of obnoxious facilities to locate within a bounded region (Q733537) (← links)
• Minimal covering unrestricted location of obnoxious facilities: bi-objective formulation and a case study (Q832797) (← links)
• Locating waste pipelines to minimize their impact on marine environment (Q864034) (← links)
• Fuzzy logic based algorithms for maximum covering location problems (Q1007856) (← links)
• Low complexity algorithms for optimal consumer push-pull partial covering in the plane (Q1014939) (← links)
• The minimal covering location and sizing problem in the presence of gradual cooperative coverage (Q2242372) (← links)
• The minimum weighted covering location problem with distance constraints (Q2384883) (← links)
• Big segment small segment global optimization algorithm on networks (Q3113501) (← links)
• Locating an obnoxious facility on a euclidean network to minimize neighborhood damage (Q4291480) (← links)
• The Location of Undesirable Facilities (Q5506725) (← links)
• Location Science in Canada (Q6102878) (← links)