Optimal approaches for upgrading selective obnoxious \(p\)-median location problems on tree networks (Q2158608): 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10479-020-03561-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3010912433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time algorithm for inverse obnoxious center location problems on networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse 1-center location problems with edge length augmentation on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time optimal approaches for reverse obnoxious center location problems on networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal algorithms for inverse vertex obnoxious center location problems on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Large Zero-One Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(p\)-maxian problem on a tree / 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: Discrete facility location and routing of obnoxious activities. / 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: Q2747613 / 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: Combinatorial algorithms for reverse selective undesirable center location problems on cycle graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reverse selective obnoxious center location problems on tree graphs / 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: Up- and downgrading the 1-center in a network / 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: A game-theoretic approach for downgrading the 1-median in the plane with Manhattan metric / 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: Q4821303 / 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: The inverse \(p\)-maxian problem on trees with variable edge lengths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4367080 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Up- and downgrading the Euclidean 1-median problem and knapsack Voronoi diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upgrading the 1-center problem with edge length variables on a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upgrading \(p\)-median problem on a path / rank
 
Normal rank

Latest revision as of 18:31, 29 July 2024

scientific article
Language Label Description Also known as
English
Optimal approaches for upgrading selective obnoxious \(p\)-median location problems on tree networks
scientific article

    Statements

    Optimal approaches for upgrading selective obnoxious \(p\)-median location problems on tree networks (English)
    0 references
    0 references
    0 references
    0 references
    26 July 2022
    0 references
    obnoxious \(p\)-median location
    0 references
    upgrading problem
    0 references
    combinatorial optimization
    0 references
    time complexity
    0 references
    tree graphs
    0 references
    0 references
    0 references
    0 references

    Identifiers