Low complexity algorithms for optimal consumer push-pull partial covering in the plane

DOI10.1016/j.ejor.2008.06.036zbMath1159.90503OpenAlexW2015268662MaRDI QIDQ1014939

Michael Segal, Shimon Abravaya

Publication date: 30 April 2009

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2008.06.036

zbMATH Keywords

optimization algorithmspartial coveringsemi-obnoxiouspull-push criteria

Mathematics Subject Classification ID

Dynamic programming (90C39)

Related Items (1)

Locating a semi-obnoxious covering facility with repelling polygonal regions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
• Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints
• Semi-obnoxious location models: A global optimization approach
• Location of an undesirable facility in a polygonal region with forbidden zones
• Efficient location for a semi-obnoxious facility
• Semi-obnoxious single facility location in Euclidean space.
• Undesirable facility location with minimal covering objectives
• A D.C. biobjective location model
• Improved algorithms for placing undesirable facilities
• Locating a semi-obnoxious covering facility with repelling polygonal regions
• Euclidean push--pull partial covering problems
• Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
• Optimal Search in Planar Subdivisions
• The expropriation location problem
• OPTIMAL FACILITY LOCATION UNDER VARIOUS DISTANCE FUNCTIONS

This page was built for publication: Low complexity algorithms for optimal consumer push-pull partial covering in the plane