The complexity analysis of the inverse center location problem
From MaRDI portal
Publication:1819202
DOI10.1023/A:1008360312607zbMath0978.90065OpenAlexW1507183619MaRDI QIDQ1819202
Zhang, Jianzhong, Xiao-guang Yang, Mao-cheng Cai
Publication date: 5 January 2000
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008360312607
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)
Related Items (79)
Inverse center location problems ⋮ On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks ⋮ The inverse connected \(p\)-median problem on block graphs under various cost functions ⋮ Inverse 1-median problem on block graphs with variable vertex weights ⋮ Optimal algorithms for some inverse uncapacitated facility location problems on networks ⋮ A linear time algorithm for inverse obnoxious center location problems on networks ⋮ Inverse eccentric vertex problem on networks ⋮ The 0–1 inverse maximum independent set problem on forests and unicyclic graphs ⋮ Inverse chromatic number problems in interval and permutation graphs ⋮ The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance ⋮ Mathematical models for the variable weights version of the inverse minimax circle location problem ⋮ The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance ⋮ Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes ⋮ Inverse median problems ⋮ Reverse selective obnoxious center location problems on tree graphs ⋮ Inverse and reverse balanced facility location problems with variable edge lengths on trees ⋮ 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 ⋮ A perturbation approach for an inverse quadratic programming problem ⋮ Inverse constrained bottleneck problems under weighted \(l_{\infty}\) norm ⋮ 2-balanced flows and the inverse 1-median problem in the Chebyshev space ⋮ Optimal algorithms for inverse vertex obnoxious center location problems on graphs ⋮ Constrained and bicriteria inverse bottleneck optimization problems under weighted Hamming distance ⋮ The Minmax Regret Reverse 1-Median Problem on Trees with Uncertain Vertex Weights ⋮ Some Inverse Traveling Salesman Problems ⋮ On inverse traveling salesman problems ⋮ The max-sum inverse median location problem on trees with budget constraint ⋮ Inverse median location problems with variable coordinates ⋮ Vertex quickest 1-center location problem on trees and its inverse problem under weighted \(l_\infty\) norm ⋮ 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 ⋮ A majorized penalty approach to inverse linear second order cone programming problems ⋮ Inverse 1-median problem on trees under weighted Hamming distance ⋮ Computation of inverse 1-center location problem on the weighted trapezoid graphs ⋮ Unnamed Item ⋮ Notes on inverse bin-packing problems ⋮ The augmented Lagrangian method for a type of inverse quadratic programming problems over second-order cones ⋮ Heuristic algorithms for the inverse mixed integer linear programming problem ⋮ On some inverse 1-center location problems ⋮ A nonconvex ADMM for a class of sparse inverse semidefinite quadratic programming problems ⋮ A perturbation approach for a type of inverse linear programming problems ⋮ Inverse \(k\)-centrum problem on trees with variable vertex weights ⋮ Reverse 2-median problem on trees ⋮ Inverse quickest center location problem on a tree ⋮ Inverse semidefinite quadratic programming problem with \(l_1\) norm measure ⋮ Inverse anti-\(k\)-centrum problem on networks with variable edge lengths ⋮ The inverse 1-median problem on a cycle ⋮ Inverse quadratic programming problem with \(l_1\) norm measure ⋮ A smoothing Newton method for a type of inverse semi-definite quadratic programming problem ⋮ Some polynomially solvable cases of the inverse ordered 1-median problem on trees ⋮ Inverse \(p\)-median problems with variable edge lengths ⋮ Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees ⋮ Inverse problems and solution methods for a class of nonlinear complementarity problems ⋮ The inverse Fermat-Weber problem ⋮ Unnamed Item ⋮ Complexity of some inverse shortest path lengths problems ⋮ An augmented Lagrangian method for a class of Inverse quadratic programming problems ⋮ Inverse group 1-median problem on trees ⋮ A modified firefly algorithm for general inverse \(p\)-Median location problems under different distance norms ⋮ Inverse Booking Problem: Inverse Chromatic Number Problem in Interval Graphs ⋮ Inverse integer programming ⋮ Inverse center location problem on a tree ⋮ An alternating direction method for solving a class of inverse semi-definite quadratic programming problems ⋮ A model for the inverse 1-median problem on trees under uncertain costs ⋮ Up- and downgrading the 1-center in a network ⋮ Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees ⋮ Some variants of reverse selective center location problem on trees under the Chebyshev and Hamming norms ⋮ Linear time optimal approaches for reverse obnoxious center location problems on networks ⋮ Inverse single facility location problem on a tree with balancing on the distance of server to clients ⋮ Inverse problems of submodular functions on digraphs ⋮ A perturbation approach for an inverse quadratic programming problem over second-order cones ⋮ Inverse 1-center location problems with edge length augmentation on trees ⋮ Inverse 1-median problem on trees under mixed rectilinear and Chebyshev norms ⋮ Assigning weights to minimize the covering radius in the plane ⋮ Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees ⋮ Some inverse optimization problems under the Hamming distance ⋮ On the Complexity of Inverse Mixed Integer Linear Optimization
This page was built for publication: The complexity analysis of the inverse center location problem
