Up- and downgrading the 1-center in a network (Q1026756): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A linear time algorithm for the reverse 1‐median problem on a cycle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reverse 2-median problem on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bottleneck Capacity Expansion Problems with General Budget Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weight reduction problems with certain bottleneck objectives. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse median problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity analysis of the inverse center location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upgrading trees under diameter and budget constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modifying edges of a network to obtain short subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4532026 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Increasing the Weight of Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing the minimum source-sink path subject to a budget constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: The inverse 1-maxian problem with edge length modification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge Weight Reduction Problems in Directed Acyclic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse combinatorial optimization: a survey on problems, methods, and results / 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: Approximation algorithms for certain network improvement problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993417 / 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: Network upgrading problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The network inhibition problem / 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
Property / cites work
 
Property / cites work: Inapproximability and a polynomially solvable special case of a network improvement problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A network improvement problem under different norms / rank
 
Normal rank

Latest revision as of 17:51, 1 July 2024

scientific article
Language Label Description Also known as
English
Up- and downgrading the 1-center in a network
scientific article

    Statements

    Up- and downgrading the 1-center in a network (English)
    0 references
    0 references
    29 June 2009
    0 references
    0 references
    combinatorial optimization
    0 references
    location problem
    0 references
    vertex center
    0 references
    upgrading
    0 references
    downgrading
    0 references
    network improvement
    0 references
    network modification
    0 references
    complexity
    0 references
    tree
    0 references
    0 references
    0 references
    0 references
    0 references