Minsum \(k\)-sink problem on path networks (Q2285143): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Created claim: Wikidata QID (P12): Q127467864, #quickstatements; #temporary_batch_1721950759712
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2962805720 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1810.10631 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minsum \(k\)-sink problem on dynamic flow path networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithms for computing \(k\)-sink on dynamic flow path networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5091004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithms for computing minmax regret sinks on dynamic path and tree networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sink Evacuation on Trees with Dynamic Confluent Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minmax centered \(k\)-partitioning of trees and applications to sink evacuation with dynamic confluent flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimax Regret 1-Sink Location Problems in Dynamic Path Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing Maximal Dynamic Flows from Static Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding kth paths and p-centers by generating and searching good data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transient flows in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2776597 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved complexity bounds for location problems on the real line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimax regret 1-sink location problem in dynamic path networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple sink location problems in dynamic path networks / 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: Robust discrete optimization and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4673411 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(n \log^2 n)\) algorithm for the optimal sink location problem in dynamic tree networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Optimization with Rational Objective Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal, Lexicographic, and Dynamic Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Universal Maximal Dynamic Flows in a Network / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127467864 / rank
 
Normal rank

Latest revision as of 00:38, 27 July 2024

scientific article
Language Label Description Also known as
English
Minsum \(k\)-sink problem on path networks
scientific article

    Statements

    Minsum \(k\)-sink problem on path networks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    16 January 2020
    0 references
    facility location
    0 references
    sink location problem
    0 references
    evacuation problem
    0 references
    minsum criterion
    0 references
    dynamic flow in network
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references