ON PLANAR MEDIANOID COMPETITIVE LOCATION PROBLEMS WITH MANHATTAN DISTANCE (Q2836517): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: An alternating heuristic for medianoid and centroid problems in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note—On a Modified One-Center Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive Location Models: A Framework and Bibliography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal packing and covering in the plane are NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: On locating new facilities in a competitive environment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive location with rectilinear distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facility location models for distribution system design / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Some Common Geometric Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993417 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(p\)-median problem: a survey of metaheuristic approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Static competitive facility location: an overview of optimisation approaches. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a branch-and-bound approach for a Huff-like Stackelberg location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Nash equilibria of a competitive location-design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(n(\log n)^{2}/\log \log n)\) algorithm for the single maximum coverage location or the \((1,X_p)\)-medianoid problem on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for finding a maximum clique in a graph / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1142/s0217595912500509 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2007273972 / rank
 
Normal rank

Latest revision as of 10:12, 30 July 2024

scientific article
Language Label Description Also known as
English
ON PLANAR MEDIANOID COMPETITIVE LOCATION PROBLEMS WITH MANHATTAN DISTANCE
scientific article

    Statements

    ON PLANAR MEDIANOID COMPETITIVE LOCATION PROBLEMS WITH MANHATTAN DISTANCE (English)
    0 references
    0 references
    0 references
    0 references
    3 July 2013
    0 references
    competitive location
    0 references
    graph of intersecting diamonds
    0 references
    medianoid problem
    0 references

    Identifiers