Locating a semi-obnoxious covering facility with repelling polygonal regions
From MaRDI portal
Publication:2444554
Recommendations
Cites work
- A D.C. biobjective location model
- A d.c. optimization method for single facility location problems
- A fractional model for locating semi-desirable facilities on networks
- An interactive solution approach for a bi-objective semi-desirable location problem
- Discrete location problems with push-pull objectives
- Efficiency for continuous facility location problems with attraction and repulsion
- Efficient location for a semi-obnoxious facility
- Euclidean push--pull partial covering problems
- Extensions to the continuous ordered median problem
- GBSSS: The generalized big square small square method for planar single- facility location
- scientific article; zbMATH DE number 1803755 (Why is no real title available?)
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- scientific article; zbMATH DE number 1340521 (Why is no real title available?)
- scientific article; zbMATH DE number 1340523 (Why is no real title available?)
- scientific article; zbMATH DE number 1033560 (Why is no real title available?)
- scientific article; zbMATH DE number 1079755 (Why is no real title available?)
- scientific article; zbMATH DE number 1559403 (Why is no real title available?)
- Locating a semi-obnoxious facility with expropriation
- Locating Objects in the Plane Using Global Optimization Techniques
- Locating semi-obnoxious facilities with expropriation: minisum criterion
- Low complexity algorithms for optimal consumer push-pull partial covering in the plane
- Multicriteria semi-obnoxious network location problems (MSNLP) with sum and center objectives
- Semi-obnoxious single facility location in Euclidean space.
- Solving the semi-desirable facility location problem using bi-objective particle swarm
- The bicriterion semi-obnoxious location (BSL) problem solved by an -approximation
- The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
- THE LARGEST EMPTY ANNULUS PROBLEM
- The Weber Problem On The Plane With Some Negative Weights
- Variable neighbourhood search: Methods and applications
- Weber's problem with attraction and repulsion under polyhedral gauges
Cited in
(6)- Low complexity algorithms for optimal consumer push-pull partial covering in the plane
- Location of an undesirable facility in a polygonal region with forbidden zones
- Euclidean push--pull partial covering problems
- Advanced greedy randomized adaptive search procedure for the obnoxious p-median problem
- scientific article; zbMATH DE number 4100913 (Why is no real title available?)
- Multiple obnoxious facility location: the case of protected areas
This page was built for publication: Locating a semi-obnoxious covering facility with repelling polygonal regions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2444554)
