Semi-obnoxious location models: A global optimization approach

DOI10.1016/S0377-2217(97)00110-0zbMATH Open0955.90054OpenAlexW2082096868MaRDI QIDQ1291602FDOQ1291602

Authors: Emilio Carrizosa, E. Conde, Dolores Romero Morales 

Publication date: 22 February 2001

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00110-0

Recommendations

• scientific article; zbMATH DE number 1340521
• The bicriterion semi-obnoxious location (BSL) problem solved by an \(\varepsilon\)-approximation
• Models and algorithms of semi-obnoxious facility location problems
• Review of obnoxious facilities location problems
• Semi-obnoxious single facility location in Euclidean space.

zbMATH Keywords

global optimizationlocation theorybig-squares small-squaressemi-obnoxious facilities

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Discrete location and assignment (90B80)

Cites Work

• Title not available (Why is that?)
• Handbook of global optimization
• Title not available (Why is that?)
• Title not available (Why is that?)
• Validation of subgradient optimization
• The Minisum and Minimax Location Problems Revisited
• Title not available (Why is that?)
• GBSSS: The generalized big square small square method for planar single- facility location
• Geometrical properties of the Fermat-Weber problem
• Analytical models for locating undesirable facilities
• Interactions between operational research and environmental management
• A d.c. optimization method for single facility location problems
• The Weber Problem On The Plane With Some Negative Weights
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (20)

• Adaptive memory search for multidemand multidimensional knapsack problems
• An interactive solution approach for a bi-objective semi-desirable location problem
• Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem
• On the ordered anti-Weber problem for any norm in \(\mathbb R^2\)
• Solving the semi-desirable facility location problem using bi-objective particle swarm
• A triobjective model for locating a public semiobnoxious facility in the plane
• A branch-and-bound algorithm for the location of facilities causing atmospheric pollution
• Location of a facility minimizing nuisance to or from a planar network
• Low complexity algorithms for optimal consumer push-pull partial covering in the plane
• Minmax regret location--allocation problem on a network under uncertainty
• A fractional model for locating semi-desirable facilities on networks
• Efficiency for continuous facility location problems with attraction and repulsion
• On heuristic bi-criterion methods for semi-obnoxious facility location
• A general model for the undesirable single facility location problem
• Alternating control tree search for knapsack/covering problems
• Aggregation error for location models: Survey and analysis
• The bicriterion semi-obnoxious location (BSL) problem solved by an \(\varepsilon\)-approximation
• Threshold robustness in discrete facility location problems: a bi-objective approach
• A bi-objective modeling approach applied to an urban semi-desirable facility location problem
• The effect of environmental criteria on locating a biorefinery: a green facility location problem

This page was built for publication: Semi-obnoxious location models: A global optimization approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1291602)