On the complexity of the \((r|p)\)-centroid problem in the plane (Q456933): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A new alternating heuristic for the (r | p)–centroid problem on the plane / 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: Q3971522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential competitive location on networks / 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: Multiple voting location and single voting location on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple voting location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for the discrete \((r| p)\)-centroid problem / rank
 
Normal rank

Latest revision as of 01:48, 9 July 2024

scientific article
Language Label Description Also known as
English
On the complexity of the \((r|p)\)-centroid problem in the plane
scientific article

    Statements

    Identifiers