Inverse obnoxious p-median location problems on trees with edge length modifications under different norms
DOI10.1016/J.TCS.2018.11.020zbMATH Open1426.90058OpenAlexW2902466745WikidataQ128869792 ScholiaQ128869792MaRDI QIDQ2632017FDOQ2632017
Esmaeil Afrashteh, Behrooz Alizadeh, Fahimeh Baroughi
Publication date: 17 May 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2018.11.020
combinatorial optimizationinverse optimizationtime complexitytree networksobnoxious \(p\)-median location
Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Cites Work
- Title not available (Why is that?)
- Introduction to algorithms
- A Faster Strongly Polynomial Minimum Cost Flow Algorithm
- Combinatorial optimization. Theory and algorithms.
- Inverse 1-center location problems with edge length augmentation on trees
- Inverse median problems
- Inverse 1-median problem on block graphs with variable vertex weights
- The inverse 1-median problem on a tree and on a path
- A linear time algorithm for inverse obnoxious center location problems on networks
- Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
- The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance
- Inverse 1-median problem on trees under weighted Hamming distance
- An algorithm for the Inverse 1-median problem on trees with variable vertex weights and edge reductions
- Inverse \(p\)-median problems with variable edge lengths
- Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees
- The inverse 1-median problem on a cycle
- Inverse median location problems with variable coordinates
- Inverse center location problem on a tree
- The inverse 1-maxian problem with edge length modification
- The inverse Fermat-Weber problem
- The \(p\)-maxian problem on a tree
- Faster shortest-path algorithms for planar graphs
- Foundations of location analysis
- A model for the inverse 1-Median problem on trees under uncertain costs
- The inverse \(p\)-maxian problem on trees with variable edge lengths
- Optimal algorithms for inverse vertex obnoxious center location problems on graphs
- A modified firefly algorithm for general inverse \(p\)-Median location problems under different distance norms
- 2-balanced flows and the inverse 1-median problem in the Chebyshev space
- Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks
- Linear Time Optimal Approaches for Max-Profit Inverse 1-Median Location Problems
Cited In (10)
- Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks
- Optimal approaches for upgrading selective obnoxious \(p\)-median location problems on tree networks
- Expanding maximum capacity path under weighted sum-type distances
- Inverse stable point problem on trees under an extension of Chebyshev norm and Bottleneck Hamming distance
- Optimal algorithms for inverse obnoxious center location problems under the weighted Chebyshev and Hamming cost norms on networks
- The cardinality constrained inverse center location problems on tree networks with edge length augmentation
- Optimal algorithms for some inverse uncapacitated facility location problems on networks
- The max-sum inverse median location problem on trees with budget constraint
- Optimal algorithms for integer inverse obnoxious \(p\)-median location problems on tree networks
- Computational aspects of the inverse single facility location problem on trees under \(l_k\)-norm
This page was built for publication: Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2632017)
