The inverse 1-maxian problem with edge length modification
From MaRDI portal
Publication:941835
DOI10.1007/s10878-007-9098-9zbMath1180.90165OpenAlexW2045213840MaRDI QIDQ941835
Publication date: 2 September 2008
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-007-9098-9
Abstract computational complexity for mathematical programming problems (90C60) Discrete location and assignment (90B80)
Related Items (35)
Reverse 1-centre problem on trees under convex piecewise-linear cost function ⋮ A linear time algorithm for inverse obnoxious center location problems on networks ⋮ Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms ⋮ Optimal approaches for upgrading selective obnoxious \(p\)-median location problems on tree networks ⋮ Upgrading the 1-center problem with edge length variables on a tree ⋮ Inverse stable point problem on trees under an extension of Chebyshev norm and Bottleneck Hamming distance ⋮ The cardinality constrained inverse center location problems on tree networks with edge length augmentation ⋮ The \(p\)-Maxian problem on interval graphs ⋮ Optimal algorithms for integer inverse obnoxious \(p\)-median location problems on tree networks ⋮ The max-sum inverse median location problem on trees with budget constraint ⋮ Inverse median location problems with variable coordinates ⋮ An inverse approach to convex ordered median problems in trees ⋮ Combinatorial algorithms for reverse selective undesirable center location problems on cycle graphs ⋮ Inverse vertex/absolute quickest 1-center location problem on a tree under weighted \(l_1\) norm ⋮ Optimal algorithms for inverse obnoxious center location problems under the weighted Chebyshev and Hamming cost norms on networks ⋮ Inverse 1-median problem on trees under weighted Hamming distance ⋮ Computation of inverse 1-center location problem on the weighted trapezoid graphs ⋮ Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks ⋮ Reverse 1-maxian problem with keeping existing 1-median ⋮ Inverse quickest center location problem on a tree ⋮ Classical and inverse median location problems under uncertain environment ⋮ 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 Fermat-Weber problem ⋮ Unnamed Item ⋮ The \(p\)-maxian problem on block graphs ⋮ A modified firefly algorithm for general inverse \(p\)-Median location problems under different distance norms ⋮ Linear Time Optimal Approaches for Max-Profit Inverse 1-Median Location Problems ⋮ Optimal algorithms for integer inverse undesirable \(p\)-median location problems on weighted extended star networks ⋮ Up- and downgrading the 1-center in a network ⋮ An algorithm for the Inverse 1-median problem on trees with variable vertex weights and edge reductions ⋮ Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees ⋮ Linear time optimal approaches for reverse obnoxious center location problems on networks ⋮ Optimal algorithms for selective variants of the classical and inverse median location problems on trees ⋮ Inverse 1-center location problems with edge length augmentation on trees
Cites Work
- Unnamed Item
- Unnamed Item
- Improving the location of minisum facilities through network modification
- Reverse 2-median problem on trees
- Minimum cost flow algorithms for series-parallel networks
- Inapproximability and a polynomially solvable special case of a network improvement problem.
- Some reverse location problems
- Inverse combinatorial optimization: a survey on problems, methods, and results
- Inverse median problems
- Graph minors. II. Algorithmic aspects of tree-width
- Obnoxious Facility Location on Graphs
- Finding the Minimum-Cost Maximum Flow in a Series-Parallel Network
- Improving the location of minimax facilities through network modification
- A linear time algorithm for the reverse 1‐median problem on a cycle
- Faster shortest-path algorithms for planar graphs
This page was built for publication: The inverse 1-maxian problem with edge length modification
