Some reverse location problems
From MaRDI portal
Publication:1576337
DOI10.1016/S0377-2217(99)00122-8zbMath0960.90056OpenAlexW2023949930MaRDI QIDQ1576337
Zhenhong Liu, Zhongfan Ma, Zhang, Jianzhong
Publication date: 20 May 2001
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00122-8
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)
Related Items
Reverse 1-centre problem on trees under convex piecewise-linear cost function ⋮ An Oracle Strongly Polynomial Algorithm for Bottleneck Expansion Problems ⋮ Inverse median problems ⋮ Reverse selective obnoxious center location problems on tree graphs ⋮ Upgrading the 1-center problem with edge length variables on a tree ⋮ Inverse and reverse balanced facility location problems with variable edge lengths on trees ⋮ A perturbation approach for an inverse quadratic programming problem ⋮ On the structure of the inverse-feasible region of a linear program ⋮ Optimal algorithms for inverse vertex obnoxious center location problems on graphs ⋮ The Minmax Regret Reverse 1-Median Problem on Trees with Uncertain Vertex Weights ⋮ The uniform cost reverse 1-centdian location problem on tree networks with edge length reduction ⋮ Combinatorial algorithms for reverse selective undesirable center location problems on cycle graphs ⋮ 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 ⋮ Weight reduction problems with certain bottleneck objectives. ⋮ Unnamed Item ⋮ The augmented Lagrangian method for a type of inverse quadratic programming problems over second-order cones ⋮ A nonconvex ADMM for a class of sparse inverse semidefinite quadratic programming problems ⋮ A perturbation approach for a type of inverse linear programming problems ⋮ Reverse maximum flow problem under the weighted Chebyshev distance ⋮ Reverse 1-maxian problem with keeping existing 1-median ⋮ Further Study on Reverse 1-Center Problem on Trees ⋮ The inverse 1-maxian problem with edge length modification ⋮ Reverse 2-median problem on trees ⋮ The inverse 1-median problem on a cycle ⋮ On the optimum capacity of capacity expansion problems ⋮ A class of bottleneck expansion problems ⋮ The inverse optimal value problem ⋮ The inverse Fermat-Weber problem ⋮ Complexity of some inverse shortest path lengths problems ⋮ Reverse 1-center problem on weighted trees ⋮ 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 ⋮ An alternating direction method for solving a class of inverse semi-definite quadratic programming problems ⋮ 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 ⋮ Facility location problems in the plane based on reverse nearest neighbor queries ⋮ A perturbation approach for an inverse quadratic programming problem over second-order cones ⋮ Assigning weights to minimize the covering radius in the plane
Cites Work
- Unnamed Item
- Improving the location of minisum facilities through network modification
- On an instance of the inverse shortest paths problem
- Inverse problem of minimum cuts
- Inverse polymatroidal flow problem
- Solution structure of some inverse combinatorial optimization problems
- On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
- Inverse matroid intersection problem
- A strongly polynomial algorithm for the inverse shortest arborescence problem
- Inverse maximum capacity problems
- Two general methods for inverse optimization problems
- Calculating some inverse linear programming problems
- An inverse DEA model for inputs/outputs estimate
- The inverse fractional matching problem
- A constrained capacity expansion problem on networks
- Improving the location of minimax facilities through network modification
- Inverse maximum flow and minimum cut problems
- An algorithm for inverse minimum spanning tree problem
- A column generation method for inverse shortest path problems
- A network flow method for solving some inverse combinatorial optimization problems
