Inverse median location problems with variable coordinates

DOI10.1007/S10100-009-0114-2zbMATH Open1204.90059OpenAlexW2013884391MaRDI QIDQ623783FDOQ623783

Behrooz Alizadeh, F. 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

Recommendations

• Inverse median problems
• The 1-median problem in \(\mathbb{R}^d\) with the Chebyshev-norm and its inverse problem
• 2-balanced flows and the inverse 1-median problem in the Chebyshev space
• Inverse 1-median problem on trees under weighted Hamming distance
• The inverse Fermat-Weber problem

zbMATH Keywords

combinatorial optimizationinverse optimizationlocation problem1-median

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (23)

• Inverse anti-\(k\)-centrum problem on networks with variable edge lengths
• Reverse 1-center problem on weighted trees
• Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks
• Optimal algorithms for selective variants of the classical and inverse median location problems on trees
• Mathematical models for the variable weights version of the inverse minimax circle location problem
• A linear time algorithm for inverse obnoxious center location problems on networks
• Inverse 1-median problem on trees under weighted Hamming distance
• A modified firefly algorithm for general inverse \(p\)-Median location problems under different distance norms
• Inverse \(k\)-centrum problem on trees with variable vertex weights
• Inverse \(p\)-median problems with variable edge lengths
• Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees
• Inverse min-max spanning \(r\)-arborescence problem under the weighted sum-type Hamming distance
• Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms
• On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks
• 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
• The reverse selective balance center location problem on trees
• 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
• Inverse median problems
• Linear Time Optimal Approaches for Max-Profit Inverse 1-Median Location Problems
• Some reverse location problems
• Optimal algorithms for integer inverse obnoxious \(p\)-median location problems on tree networks
• Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q623783)