One-way and round-trip center location problems (Q2568335): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Selecting distances in the plane / 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: Q3478263 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3893826 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The collection depots location problem on networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facility location with dynamic distance functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric pattern matching in \(d\)-dimensional space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improvements on geometric pattern matching 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: One-facility location with rectilinear tour distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arrangements of curves in the plane --- topology, combinatorics, and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of selection and ranking in X+Y and matrices with sorted columns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Finding Nearest Common Ancestors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the upper envelope of n line segments in O(n log n) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Best Possible Heuristic for the <i>k</i>-Center Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithmic Approach to Network Location Problems. II: The<i>p</i>-Medians / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault tolerant \(K\)-center problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal approximation algorithm for the rectilinear m-center problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Round-Trip <i>p</i>-Center and Covering Problem on a Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3971521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Optimization with Rational Objective Functions / 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: Linear Programming in Linear Time When the Dimension Is Fixed / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Results on the Complexity of <i>p</i>-Centre Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $O(n\log ^2 n)$ Algorithm for the <i>k</i>th Longest Path in a Tree with Applications to Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Upper Bounds in Klee’s Measure Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic for the p-center problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3800086 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of Vertex Elimination on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4325546 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n) algorithm for the linear multiple choice knapsack problem and related problems / rank
 
Normal rank

Latest revision as of 17:19, 10 June 2024

scientific article
Language Label Description Also known as
English
One-way and round-trip center location problems
scientific article

    Statements

    One-way and round-trip center location problems (English)
    0 references
    0 references
    0 references
    10 October 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    facility location
    0 references
    tree networks
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references