Inverse median location problems with variable coordinates

DOI10.1007/s10100-009-0114-2zbMath1204.90059OpenAlexW2013884391MaRDI QIDQ623783

Behrooz Alizadeh, Fahimeh Baroughi Bonab, Rainer E. Burkard

Publication date: 8 February 2011

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10100-009-0114-2

zbMATH Keywords

location problemcombinatorial optimizationinverse optimization1-median

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (21)

On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks ⋮ Optimal algorithms for some inverse uncapacitated facility location problems on networks ⋮ 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 ⋮ Mathematical models for the variable weights version of the inverse minimax circle location problem ⋮ The cardinality constrained inverse center location problems on tree networks with edge length augmentation ⋮ A generalized interval type-2 fuzzy random variable based algorithm under mean chance value at risk criterion for inverse 1-median location problems on tree networks with uncertain costs ⋮ Optimal algorithms for integer inverse obnoxious \(p\)-median location problems on tree networks ⋮ The reverse selective balance center location problem on trees ⋮ Inverse 1-median problem on trees under weighted Hamming distance ⋮ Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks ⋮ Inverse \(k\)-centrum problem on trees with variable vertex weights ⋮ Inverse anti-\(k\)-centrum problem on networks with variable edge lengths ⋮ Inverse \(p\)-median problems with variable edge lengths ⋮ Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees ⋮ Reverse 1-center problem on weighted trees ⋮ 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 ⋮ Inverse min-max spanning r-arborescence problem under the weighted sum-type Hamming distance ⋮ Optimal algorithms for selective variants of the classical and inverse median location problems on trees ⋮ Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees

Cites Work

• Unnamed Item
• Unnamed Item
• Inverse \(p\)-median problems with variable edge lengths
• Inverse center location problem on a tree
• The inverse 1-maxian problem with edge length modification
• The inverse 1-median problem on a cycle
• The inverse Fermat-Weber problem
• Inverse 1-center location problems with edge length augmentation on trees
• The complexity analysis of the inverse center location problem
• Approximation schemes for a class of subset selection problems
• Inverse median problems
• Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
• An Algorithm for Large Zero-One Knapsack Problems

This page was built for publication: Inverse median location problems with variable coordinates