Pages that link to "Item:Q1291602"

The following pages link to Semi-obnoxious location models: A global optimization approach (Q1291602):

Displaying 17 items.

• Threshold robustness in discrete facility location problems: a bi-objective approach (Q499687) (← links)
• Solving the semi-desirable facility location problem using bi-objective particle swarm (Q856268) (← links)
• Minmax regret location--allocation problem on a network under uncertainty (Q864020) (← links)
• Location of a facility minimizing nuisance to or from a planar network (Q947950) (← links)
• An interactive solution approach for a bi-objective semi-desirable location problem (Q960111) (← links)
• On the ordered anti-Weber problem for any norm in \(\mathbb R^2\) (Q969512) (← links)
• Alternating control tree search for knapsack/covering problems (Q972644) (← links)
• Low complexity algorithms for optimal consumer push-pull partial covering in the plane (Q1014939) (← links)
• Efficiency for continuous facility location problems with attraction and repulsion (Q1026586) (← links)
• Aggregation error for location models: Survey and analysis (Q1026594) (← links)
• A triobjective model for locating a public semiobnoxious facility in the plane (Q1666194) (← links)
• Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem (Q1755228) (← links)
• A bi-objective modeling approach applied to an urban semi-desirable facility location problem (Q1927006) (← links)
• On heuristic bi-criterion methods for semi-obnoxious facility location (Q2340496) (← links)
• A general model for the undesirable single facility location problem (Q2466592) (← links)
• Adaptive memory search for multidemand multidimensional knapsack problems (Q2489302) (← links)
• A fractional model for locating semi-desirable facilities on networks (Q5955092) (← links)