An algorithm for solving the bi-objective median path-shaped facility on a tree network (Q2305157): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1186/s42787-019-0063-4 / rank
Normal rank
 
Property / author
 
Property / author: Abdallah W. Aboutahoun / rank
Normal rank
 
Property / author
 
Property / author: Abdallah W. Aboutahoun / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1186/s42787-019-0063-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3000326073 / 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: Algorithms for path medi-centers of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: INDUCTIVE ALGORITHMS ON FINITE TREES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the \(\ell\)-core of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for central-median paths with bounded length on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal algorithms for the path/tree-shaped facility location problems in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3012190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm for the multicriteria cent-dian location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bound sets for biobjective combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria network location problems with sum objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple facility location on a network with linear reliability order of edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithmic Approach to Network Location Problems. I: The<i>p</i>-Centers / 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: The inverse \(p\)-maxian problem on trees with variable edge lengths / 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: The bi‐criteria doubly weighted center‐median path problem on a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of solution strategies for biobjective shortest path problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-phase algorithm for the biobjective integer minimum cost flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating a facility on a network with multiple median-type objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing all efficient solutions of the biobjective minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional location of path and tree shaped facilities on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The centdian subtree on tree networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4889471 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm for the weighted backup 2-center problem on a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a core of a tree with pos/neg weight / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1186/S42787-019-0063-4 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:08, 17 December 2024

scientific article
Language Label Description Also known as
English
An algorithm for solving the bi-objective median path-shaped facility on a tree network
scientific article

    Statements

    An algorithm for solving the bi-objective median path-shaped facility on a tree network (English)
    0 references
    0 references
    0 references
    10 March 2020
    0 references
    two-phase method
    0 references
    Pareto solution
    0 references
    median path
    0 references
    \(k\)-best algorithm
    0 references
    0 references
    0 references

    Identifiers

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