Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights (Q2232232): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W3134604564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearest common ancestors: a survey and a new algorithm for a distributed environment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4508365 / 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: Minsum \(k\)-sink problem on 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: 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: Constructing Maximal Dynamic Flows from Static Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes / 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: Minimax regret 1-sink location problem in dynamic path networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimax regret 1-median 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: The Quickest Transshipment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimax regret 1-sink location problem with accessibility in dynamic general networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimax regret vertex 2-sink location problem in dynamic path networks / 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: An Introduction to Network Flows over Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4239707 / rank
 
Normal rank

Latest revision as of 19:11, 26 July 2024

scientific article
Language Label Description Also known as
English
Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights
scientific article

    Statements

    Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    4 October 2021
    0 references
    0 references
    0 references
    0 references
    0 references