Dispersing facilities on planar segment and circle amidst repulsion (Q6112004): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10898-023-01303-x / rank
 
Normal rank
Property / published in
 
Property / published in: Journal of Global Optimization / rank
 
Normal rank
Property / publication date
 
26 January 2024
Timestamp+2024-01-26T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 26 January 2024 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C39 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 7795434 / rank
 
Normal rank
Property / zbMATH Keywords
 
continuous facility location
Property / zbMATH Keywords: continuous facility location / rank
 
Normal rank
Property / zbMATH Keywords
 
approximation scheme
Property / zbMATH Keywords: approximation scheme / rank
 
Normal rank
Property / zbMATH Keywords
 
segment tree
Property / zbMATH Keywords: segment tree / rank
 
Normal rank
Property / zbMATH Keywords
 
dynamic programming
Property / zbMATH Keywords: dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing the number of obnoxious facilities to locate within a bounded region / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of Parametric Searching in Geometric Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum-width empty square and rectangular annulus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Review of obnoxious facilities location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Slowing down sorting networks to obtain faster sorting algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE LARGEST EMPTY ANNULUS PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Selection and Ranking: Sorted Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for covering and packing problems in image processing and VLSI / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithms for placing undesirable facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying Parallel Computation Algorithms in the Design of Serial Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2766841 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4229625 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4825540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obnoxious Facility Location on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dispersing facilities on planar segment and circle amidst repulsion / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:04, 23 August 2024

scientific article; zbMATH DE number 7722897
Language Label Description Also known as
English
Dispersing facilities on planar segment and circle amidst repulsion
scientific article; zbMATH DE number 7722897

    Statements

    Dispersing facilities on planar segment and circle amidst repulsion (English)
    0 references
    0 references
    4 August 2023
    0 references
    26 January 2024
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    obnoxious facility location
    0 references
    parametric search
    0 references
    continuous location
    0 references
    continuous facility location
    0 references
    approximation scheme
    0 references
    segment tree
    0 references
    dynamic programming
    0 references