Pages that link to "Item:Q3985539"

The following pages link to Obnoxious Facility Location on Graphs (Q3985539):

Displaying 20 items.

• Strategy-Proof Mechanism for Obnoxious Facility Location on a Line (Q3196371) (← links)
• Condorcet winner configurations of linear networks (Q3577841) (← links)
• Locating an obnoxious facility on a euclidean network to minimize neighborhood damage (Q4291480) (← links)
• Minimum-diameter covering problems (Q4520238) (← links)
• Geometric Packing under Nonuniform Constraints (Q4593249) (← links)
• Facility dispersion and remote subgraphs (Q5054806) (← links)
• Dispersing Obnoxious Facilities on a Graph (Q5090483) (← links)
• The Location of Undesirable Facilities (Q5506725) (← links)
• OBNOXIOUS FACILITY LOCATION: THE CASE OF WEIGHTED DEMAND POINTS (Q5888151) (← links)
• Less is more approach: basic variable neighborhood search for the obnoxious <i>p</i>‐median problem (Q6066720) (← links)
• The maximum linear arrangement problem for trees under projectivity and planarity (Q6072193) (← links)
• Solving of the maxisum location problem on network with a restriction on transport costs (Q6081727) (← links)
• A parallel variable neighborhood search approach for the obnoxious <i>p</i>‐median problem (Q6088247) (← links)
• Dispersing facilities on planar segment and circle amidst repulsion (Q6112004) (← links)
• Obnoxious facility location in multiple dimensional space (Q6113555) (← links)
• A new approach to the multiple obnoxious facility location problem based on combinatorial and continuous tools (Q6492453) (← links)
• A matheuristic for locating obnoxious facilities (Q6568397) (← links)
• Selectively closing recycling centers in Bavaria: reforming waste-management policy to reduce disparity (Q6599056) (← links)
• Dispersion problem on a convex polygon (Q6602315) (← links)
• An iterated greedy algorithm with variable reconstruction size for the obnoxious \(p\)-median problem (Q6609705) (← links)