scientific article
From MaRDI portal
Publication:2861561
zbMath1274.90305MaRDI QIDQ2861561
Publication date: 8 November 2013
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571065310001587
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (33)
On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks ⋮ Inverse 1-median problem on block graphs with variable vertex weights ⋮ 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 ⋮ The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance ⋮ The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance ⋮ Inverse and reverse balanced facility location problems with variable edge lengths on trees ⋮ The inverse 1-median location problem on uncertain tree networks with tail value at risk criterion ⋮ Inverse stable point problem on trees under an extension of Chebyshev norm and Bottleneck Hamming distance ⋮ 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 ⋮ Combinatorial algorithms for reverse selective undesirable center location problems on cycle graphs ⋮ Computational aspects of the inverse single facility location problem on trees under \(l_k\)-norm ⋮ Inverse 1-median problem on trees under weighted Hamming distance ⋮ Unnamed Item ⋮ The inverse 1-median problem on tree networks with variable real edge lengths ⋮ On some inverse 1-center location problems ⋮ The inverse 1-center problem on cycles with variable edge lengths ⋮ Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks ⋮ Inverse \(k\)-centrum problem on trees with variable vertex weights ⋮ Classical and inverse median location problems under uncertain environment ⋮ Inverse anti-\(k\)-centrum problem on networks with variable edge lengths ⋮ Some polynomially solvable cases of the inverse ordered 1-median problem on trees ⋮ Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees ⋮ Inverse group 1-median problem on 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 ⋮ Optimal algorithms for integer inverse undesirable \(p\)-median location problems on weighted extended star networks ⋮ A model for the inverse 1-median problem on trees under uncertain costs ⋮ Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees ⋮ Intuitionistic fuzzy inverse 1-median location problem on tree networks with value at risk objective ⋮ Inverse single facility location problem on a tree with balancing on the distance of server to clients ⋮ Inverse 1-center location problems with edge length augmentation on trees ⋮ Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees
Cites Work
This page was built for publication:
