The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance

DOI10.1016/J.EJOR.2015.06.064zbMATH Open1346.90712OpenAlexW804266806MaRDI QIDQ320084FDOQ320084

Authors: Kien Trung Nguyen, André Chassein 

Publication date: 6 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2015.06.064

Recommendations

• Inverse 1-median problem on trees under weighted Hamming distance
• The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance
• Inverse 1-median problem on trees under mixed rectilinear and Chebyshev norms
• The inverse \(p\)-maxian problem on trees with variable edge lengths
• Some polynomially solvable cases of the inverse ordered 1-median problem on trees

zbMATH Keywords

treeHamming distanceconvexinverse optimization problemChebyshev normordered median

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Inverse combinatorial optimization: a survey on problems, methods, and results
• Location theory. A unified approach
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Inverse 1-center location problems with edge length augmentation on trees
• The complexity analysis of the inverse center location problem
• Inverse median problems
• The inverse 1-median problem on a tree and on a path
• Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
• An inverse approach to convex ordered median problems in trees
• Inverse 1-median problem on trees under weighted Hamming distance
• 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
• The inverse 1-median problem on a cycle
• Pioneering Developments in Location Analysis
• The inverse Fermat-Weber problem
• Algorithmic results for ordered median problems
• The \(k\)-centrum multi-facility location problem

Cited In (29)

• The inverse connected \(p\)-median problem on block graphs under various cost functions
• Inverse anti-\(k\)-centrum problem on networks with variable edge lengths
• Some polynomially solvable cases of the inverse ordered 1-median problem on trees
• Linear time optimal approaches for MAX-profit inverse 1-Mmdian location problems
• Inverse group 1-median problem on trees
• Inverse 1-median problem on block graphs with variable vertex weights
• The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance
• An inverse approach to convex ordered median problems in trees
• 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
• The minmax regret inverse maximum weight problem
• Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms
• Variable-sized uncertainty and inverse problems in robust optimization
• The reverse 1-median problem on a cycle under the Hamming distance
• Vertex quickest 1-center location problem on trees and its inverse problem under weighted \(l_\infty\) norm
• On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks
• Some robust inverse median problems on trees with interval costs
• 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
• Capacitated partial inverse maximum spanning tree under the weighted Hamming distance
• The ordered anti-median problem with distances derived from a strictly convex norm
• The max-sum inverse median location problem on trees with budget constraint
• A linear time algorithm for the \(p\)-maxian problem on trees with distance constraint
• The inverse 1-center problem on cycles with variable edge lengths
• Robust reverse 1-center problems on trees with interval costs
• Inverse stable point problem on trees under an extension of Chebyshev norm and bottleneck Hamming distance
• On some inverse 1-center location problems
• Computational aspects of the inverse single facility location problem on trees under \(l_k\)-norm
• Inverse 1-median problem on trees under mixed rectilinear and Chebyshev norms

This page was built for publication: The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance

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