Pages that link to "Item:Q1869670"

The following pages link to The bicriterion semi-obnoxious location (BSL) problem solved by an \(\varepsilon\)-approximation (Q1869670):

Displaying 16 items.

• The multicriteria big cube small cube method (Q611015) (← links)
• Minimal covering unrestricted location of obnoxious facilities: bi-objective formulation and a case study (Q832797) (← links)
• Undesirable facility location problems on multicriteria networks (Q853902) (← links)
• Solving the semi-desirable facility location problem using bi-objective particle swarm (Q856268) (← links)
• An interactive solution approach for a bi-objective semi-desirable location problem (Q960111) (← links)
• Multiple criteria facility location problems: a survey (Q988401) (← links)
• Efficiency for continuous facility location problems with attraction and repulsion (Q1026586) (← links)
• A triobjective model for locating a public semiobnoxious facility in the plane (Q1666194) (← links)
• Dispersion with connectivity in wireless mesh networks (Q1716989) (← links)
• OR models in urban service facility location: a critical review of applications and future developments (Q1728469) (← links)
• A bi-objective modeling approach applied to an urban semi-desirable facility location problem (Q1927006) (← links)
• Location of a semi-obnoxious facility with elliptic maximin and network minisum objectives (Q2253362) (← links)
• On heuristic bi-criterion methods for semi-obnoxious facility location (Q2340496) (← links)
• Locating a semi-obnoxious covering facility with repelling polygonal regions (Q2444554) (← links)
• Finding representative systems for discrete bicriterion optimization problems (Q2467474) (← links)
• (Q6039732) (← links)