Euclidean push--pull partial covering problems
From MaRDI portal
Recommendations
Cites work
- A D.C. biobjective location model
- A multi-facility location model with partial satisfaction of demand
- Constructing Levels in Arrangements and Higher Order Voronoi Diagrams
- Efficient location for a semi-obnoxious facility
- scientific article; zbMATH DE number 1220053 (Why is no real title available?)
- scientific article; zbMATH DE number 1253058 (Why is no real title available?)
- scientific article; zbMATH DE number 1340521 (Why is no real title available?)
- scientific article; zbMATH DE number 1559403 (Why is no real title available?)
- Location of an undesirable facility in a polygonal region with forbidden zones
- On k-Nearest Neighbor Voronoi Diagrams in the Plane
- Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints
- Undesirable facility location with minimal covering objectives
Cited in
(11)- Low complexity algorithms for optimal consumer push-pull partial covering in the plane
- Efficiency for continuous facility location problems with attraction and repulsion
- A modular capacitated multi-objective model for locating maritime search and rescue vessels
- A bi-objective modeling approach applied to an urban semi-desirable facility location problem
- Locating a semi-obnoxious covering facility with repelling polygonal regions
- Equality measures properties for location problems
- The multicriteria big cube small cube method
- On solving the planar k-centrum problem with Euclidean distances
- Planar expropriation problem with non-rigid rectangular facilities
- Covering point sets with two disjoint disks or squares
- Multiple criteria facility location problems: a survey
This page was built for publication: Euclidean push--pull partial covering problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2496058)