The inverse connected \(p\)-median problem on block graphs under various cost functions (Q827099): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10479-020-03651-3 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Combinatorial algorithms for inverse network flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The connected \(p\)-center problem on cactus 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 inverse Fermat-Weber problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse median problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The inverse 1-median problem on a cycle / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an instance of the inverse shortest paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The partial inverse minimum spanning tree problem when weight increase is forbidden / 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: The connected \(p\)-median problem on block graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On inverse traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse minimum flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Characterization of Block-Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inverse approach to convex ordered median problems in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse 1-median problem on trees under weighted Hamming distance / 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: Efficient Algorithms for the Inverse Spanning-Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for connected \(p\)-centdian problem on block graphs / 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: Inverse quickest center location problem on a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse 1-median problem on block graphs with variable vertex weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: The inverse 1-center problem on cycles with variable edge lengths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse \(k\)-centrum problem on trees with variable vertex weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: A model for the inverse 1-median problem on trees under uncertain costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some inverse 1-center location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Location Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The inverse \(\{0,1\}\)-knapsack problem: theory, algorithms and computational experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intuitionistic fuzzy inverse 1-median location problem on tree networks with value at risk objective / rank
 
Normal rank
Property / cites work
 
Property / cites work: The inverse 1-median location problem on uncertain tree networks with tail value at risk criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: On inverse linear programming problems under the bottleneck-type weighted Hamming distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: The connected \(p\)-center problem on block graphs with forbidden vertices / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10479-020-03651-3 / rank
 
Normal rank

Latest revision as of 04:20, 10 December 2024

scientific article
Language Label Description Also known as
English
The inverse connected \(p\)-median problem on block graphs under various cost functions
scientific article

    Statements

    The inverse connected \(p\)-median problem on block graphs under various cost functions (English)
    0 references
    0 references
    0 references
    6 January 2021
    0 references
    combinatorial optimization
    0 references
    location theory
    0 references
    connected \(p\)-median
    0 references
    inverse optimization
    0 references
    block graphs
    0 references
    0 references
    0 references

    Identifiers