Pages that link to "Item:Q3748029"

The following pages link to Location of Multiple Obnoxious Facilities (Q3748029):

Displaying 33 items.

• Probabilistic single obnoxious facility location with fixed budget (Q413284) (← links)
• A multiobjective model for locating undesirable facilities (Q689245) (← links)
• A branch-and-cut method for the obnoxious \(p\)-median problem (Q926563) (← links)
• On the ordered anti-Weber problem for any norm in \(\mathbb R^2\) (Q969512) (← links)
• Efficiency for continuous facility location problems with attraction and repulsion (Q1026586) (← links)
• Locating an undesirable facility with a minimax criterion (Q1066793) (← links)
• Determining an optimum location for an undesirable facility in a workroom environment (Q1084005) (← links)
• Analytical models for locating undesirable facilities (Q1118522) (← links)
• Locating an obnoxious facility (Q1195639) (← links)
• The obnoxious \(p\) facility network location problem with facility interaction (Q1291604) (← links)
• The dynamics and internal geometry of the three-city noxious location problem (Q1310194) (← links)
• The obnoxious center problem on weighted cactus graphs. (Q1427192) (← links)
• A note on the location of an obnoxious facility on a network (Q1579481) (← links)
• The Weber obnoxious facility location model: a big arc small arc approach (Q1651661) (← links)
• Undesirable facility location with minimal covering objectives (Q1806769) (← links)
• The discrete p-maxian location problem (Q1824542) (← links)
• Obnoxious-facility location and data-envelopment analysis: a combined distance-based formula\-tion (Q1847216) (← links)
• The location of ambivalent facilities: Use of a quadratic zero-one programming algorithm (Q1893707) (← links)
• Alternative formulations for the obnoxious \(p\)-median problem (Q2217491) (← links)
• The obnoxious facilities planar \(p\)-median problem (Q2241906) (← links)
• The minimum weighted covering location problem with distance constraints (Q2384883) (← links)
• Locating a semi-obnoxious facility with expropriation (Q2384885) (← links)
• Review of obnoxious facilities location problems (Q2669654) (← links)
• Obnoxious facility location: complete service with minimal harm (Q2708039) (← links)
• Axiomatization and the antimean function on paths (Q2931923) (← links)
• Location of an Obnoxious Route (Q3033533) (← links)
• Obnoxious Facility Location on Graphs (Q3985539) (← links)
• Is Linear Programming Necessary for Single Facility Location with Maximin of Rectilinear Distance? (Q4287629) (← links)
• The Location of Undesirable Facilities (Q5506725) (← links)
• Minimum covering criterion for obnoxious facility location on a network (Q5689812) (← links)
• Solving nonconvex nonlinear programs with reverse convex constraints by sequential linear programming (Q6090468) (← links)
• Location Science in Canada (Q6102878) (← links)
• Obnoxious facility location in multiple dimensional space (Q6113555) (← links)