The complexity analysis of the inverse center location problem
From MaRDI portal
Recommendations
Cited in
(84)- The inverse connected p-median problem on block graphs under various cost functions
- Computation of inverse 1-center location problem on the weighted trapezoid graphs
- The 1-median problem in \(\mathbb{R}^d\) with the Chebyshev-norm and its inverse problem
- Inverse semidefinite quadratic programming problem with \(l_1\) norm measure
- Inverse anti-k-centrum problem on networks with variable edge lengths
- Complexity of Determining the Most Vital Elements for the 1-median and 1-center Location Problems
- scientific article; zbMATH DE number 1932373 (Why is no real title available?)
- Inverse problems and solution methods for a class of nonlinear complementarity problems
- Assigning weights to minimize the covering radius in the plane
- Some polynomially solvable cases of the inverse ordered 1-median problem on trees
- Inverse group 1-median problem on trees
- Inverse 1-median problem on block graphs with variable vertex weights
- 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 eccentric vertex problem on networks
- Inverse quickest center location problem on a tree
- 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
- Optimal algorithms for inverse vertex obnoxious center location problems on graphs
- An inverse approach to convex ordered median problems in trees
- Inverse 1-median problem on trees under weighted Hamming distance
- Inverse center location problems
- Inverse \(k\)-centrum problem on trees with variable vertex weights
- A modified firefly algorithm for general inverse \(p\)-Median location problems under different distance norms
- Inverse p-median problems with variable edge lengths
- Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees
- 2-balanced flows and the inverse 1-median problem in the Chebyshev space
- Inverse quadratic programming problem with \(l_1\) norm measure
- Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes
- The inverse 1-median problem on a cycle
- An augmented Lagrangian method for a class of Inverse quadratic programming problems
- Inverse 1-center location problems with edge length augmentation on trees
- 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
- Inverse chromatic number problems in interval and permutation graphs
- The \(0-1\) inverse maximum independent set problem on forests and unicyclic graphs
- Inverse median location problems with variable coordinates
- Some robust inverse median problems on trees with interval costs
- Some Inverse Traveling Salesman Problems
- Inverse constrained bottleneck problems under weighted \(l_{\infty}\) norm
- Some variants of reverse selective center location problem on trees under the Chebyshev and Hamming norms
- Reverse selective obnoxious center location problems on tree graphs
- Inverse center location problem on a tree
- Notes on inverse bin-packing problems
- The augmented Lagrangian method for a type of inverse quadratic programming problems over second-order cones
- Inverse Booking Problem: Inverse Chromatic Number Problem in Interval Graphs
- Constrained and bicriteria inverse bottleneck optimization problems under weighted Hamming distance
- Heuristic algorithms for the inverse mixed integer linear programming problem
- A smoothing Newton method for a type of inverse semi-definite quadratic programming problem
- The inverse Fermat-Weber problem
- 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
- The cardinality constrained inverse center location problems on tree networks with edge length augmentation
- A majorized penalty approach to inverse linear second order cone programming problems
- Reverse 2-median problem on trees
- Inverse problems of submodular functions on digraphs
- Up- and downgrading the 1-center in a network
- Optimal algorithms for some inverse uncapacitated facility location problems on networks
- Inverse median problems
- On the complexity of inverse mixed integer linear optimization
- The max-sum inverse median location problem on trees with budget constraint
- A model for the inverse 1-Median problem on trees under uncertain costs
- A perturbation approach for a type of inverse linear programming problems
- Combinatorial algorithms for reverse selective undesirable center location problems on cycle graphs
- A perturbation approach for an inverse quadratic programming problem
- Linear time optimal approaches for reverse obnoxious center location problems on networks
- The Minmax Regret Reverse 1-Median Problem on Trees with Uncertain Vertex Weights
- On inverse traveling salesman problems
- Inverse integer programming
- Inverse single facility location problem on a tree with balancing on the distance of server to clients
- scientific article; zbMATH DE number 7709522 (Why is no real title available?)
- A perturbation approach for an inverse quadratic programming problem over second-order cones
- Robust reverse 1-center problems on trees with interval costs
- Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
- Inverse stable point problem on trees under an extension of Chebyshev norm and bottleneck Hamming distance
- A nonconvex ADMM for a class of sparse inverse semidefinite quadratic programming problems
- On some inverse 1-center location problems
- An alternating direction method for solving a class of inverse semi-definite quadratic programming problems
- Inverse and reverse balanced facility location problems with variable edge lengths on trees
- Inverse 1-median problem on trees under mixed rectilinear and Chebyshev norms
- Some inverse optimization problems under the Hamming distance
- Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees
- A penalty-type method for solving inverse optimal value problem in second-order conic programming
- Complexity of some inverse shortest path lengths problems
This page was built for publication: The complexity analysis of the inverse center location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1819202)
