Locating a semi-obnoxious covering facility with repelling polygonal regions

DOI10.1016/j.dam.2013.05.010zbMath1288.90042OpenAlexW1971330258MaRDI QIDQ2444554

Yanyan Li

Publication date: 10 April 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2013.05.010

zbMATH Keywords

coveringcontinuous locationEuclidean distancemargin maximizationpush-pullsemi-obnoxious facility

Mathematics Subject Classification ID

Continuous location (90B85)

Related Items (2)

Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem ⋮ Low complexity algorithms for optimal consumer push-pull partial covering in the plane

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Discrete location problems with push-pull objectives
• Solving the semi-desirable facility location problem using bi-objective particle swarm
• An interactive solution approach for a bi-objective semi-desirable location problem
• Extensions to the continuous ordered median problem
• Low complexity algorithms for optimal consumer push-pull partial covering in the plane
• Efficiency for continuous facility location problems with attraction and repulsion
• Variable neighbourhood search: Methods and applications
• GBSSS: The generalized big square small square method for planar single- facility location
• Weber's problem with attraction and repulsion under polyhedral gauges
• Efficient location for a semi-obnoxious facility
• Semi-obnoxious single facility location in Euclidean space.
• A D.C. biobjective location model
• The bicriterion semi-obnoxious location (BSL) problem solved by an \(\varepsilon\)-approximation
• Multicriteria semi-obnoxious network location problems (MSNLP) with sum and center objectives
• A d.c. optimization method for single facility location problems
• Locating a semi-obnoxious facility with expropriation
• Euclidean push--pull partial covering problems
• Locating Objects in the Plane Using Global Optimization Techniques
• The Weber Problem On The Plane With Some Negative Weights
• The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
• THE LARGEST EMPTY ANNULUS PROBLEM
• Locating semi-obnoxious facilities with expropriation: minisum criterion
• A fractional model for locating semi-desirable facilities on networks

This page was built for publication: Locating a semi-obnoxious covering facility with repelling polygonal regions