Low complexity algorithms for optimal consumer push-pull partial covering in the plane (Q1014939): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2008.06.036 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2015268662 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4344150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689812 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The expropriation location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: OPTIMAL FACILITY LOCATION UNDER VARIOUS DISTANCE FUNCTIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: A D.C. biobjective location model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2708098 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-obnoxious location models: A global optimization approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undesirable facility location with minimal covering objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4265879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4229625 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating a semi-obnoxious covering facility with repelling polygonal regions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithms for placing undesirable facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Search in Planar Subdivisions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-obnoxious single facility location in Euclidean space. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3219753 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Location of an undesirable facility in a polygonal region with forbidden zones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euclidean push--pull partial covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526867 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient location for a semi-obnoxious facility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4825540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments / rank
 
Normal rank

Latest revision as of 12:17, 1 July 2024

scientific article
Language Label Description Also known as
English
Low complexity algorithms for optimal consumer push-pull partial covering in the plane
scientific article

    Statements

    Low complexity algorithms for optimal consumer push-pull partial covering in the plane (English)
    0 references
    0 references
    0 references
    30 April 2009
    0 references
    pull-push criteria
    0 references
    semi-obnoxious
    0 references
    partial covering
    0 references
    optimization algorithms
    0 references

    Identifiers