Locating tree-shaped facilities using the ordered median objective (Q1771313): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q58217294, #quickstatements; #temporary_batch_1711626644914
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Finding the two-core of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for finding the (k,l)-core of tree networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A review of extensive facility location in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4380371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Depth-First Dynamic Programming Algorithm for the Tree Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Some Maximum Average Weight Problems with Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted <i>k</i>‐cardinality trees: Complexity and polyhedral structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aggregation Error Bounds for a Class of Location Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case incremental analysis for a class ofp-facility location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On locating path- or tree-shaped facilities on networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multifacility ordered median problems on networks: A further analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic results for ordered median problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689811 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5292089 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The optimal location of a path or tree in a tree network / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding the core of a tree with a specified length / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for a core of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4934873 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the sum of the \(k\) largest functions in linear time. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for Finding a Core of a Tree with a Specified Length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for a Core and k-Tree Core of a Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing symmetric submodular functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A flexible approach to location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4367277 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unifying location model on tree graphs based on submodularity property / 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: Fully polynomial approximation schemes for locating a tree-shaped facility: A generalization of the knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(k\)-centrum multi-facility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting weighted distances with applications to objective function evaluations in single facility location problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generalized <i>P</i>‐forest problem on a tree network / rank
 
Normal rank
Property / cites work
 
Property / cites work: The centdian subtree on tree networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Parallel Algorithms for Optimally Locating a Path and a Tree of a Specified Length in a Weighted Tree Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a 2-Core of a Tree in Linear Time / rank
 
Normal rank

Latest revision as of 10:11, 10 June 2024

scientific article
Language Label Description Also known as
English
Locating tree-shaped facilities using the ordered median objective
scientific article

    Statements

    Locating tree-shaped facilities using the ordered median objective (English)
    0 references
    0 references
    0 references
    19 April 2005
    0 references
    0 references
    tree network
    0 references
    linear programming
    0 references
    dynamic programming
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references