Some reverse location problems
From MaRDI portal
Publication:1576337
DOI10.1016/S0377-2217(99)00122-8zbMATH Open0960.90056OpenAlexW2023949930MaRDI QIDQ1576337FDOQ1576337
Authors: Zhenhong Liu, Zhongfan Ma, Jianzhong Zhang 
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
Recommendations
- scientific article; zbMATH DE number 1522936
- Inverse center location problems
- Location problems
- The locator problem
- A solvable case of the location problem
- Location Problems with Cutoff
- Inverse median location problems with variable coordinates
- scientific article; zbMATH DE number 714106
- Located sets and reverse mathematics
- A generalized location problem
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)
Cites Work
- Network flows. Theory, algorithms, and applications.
- Inverse problem of minimum cuts
- Inverse maximum flow and minimum cut problems
- On an instance of the inverse shortest paths problem
- Calculating some inverse linear programming problems
- An inverse DEA model for inputs/outputs estimate
- Improving the location of minimax facilities through network modification
- On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
- A column generation method for inverse shortest path problems
- Solution structure of some inverse combinatorial optimization problems
- Two general methods for inverse optimization problems
- Improving the location of minisum facilities through network modification
- Inverse maximum capacity problems
- An algorithm for inverse minimum spanning tree problem
- A constrained capacity expansion problem on networks
- Inverse polymatroidal flow problem
- Inverse matroid intersection problem
- A strongly polynomial algorithm for the inverse shortest arborescence problem
- A network flow method for solving some inverse combinatorial optimization problems
- The inverse fractional matching problem
Cited In (52)
- The inverse optimal value problem
- Locating facilities which interact: Some solvable cases
- Reverse 1-center problem on weighted trees
- Facility location problems in the plane based on reverse nearest neighbor queries
- Assigning weights to minimize the covering radius in the plane
- Location problems
- Further study on reverse 1-center problem on trees
- Linear time optimal approaches for MAX-profit inverse 1-Mmdian location problems
- Two classes of location problems on tree networks
- Optimal algorithms for inverse vertex obnoxious center location problems on graphs
- Reverse 1-maxian problem with keeping existing 1-median
- Upgrading the 1-center problem with edge length variables on a tree
- Title not available (Why is that?)
- Reverse 1-centre problem on trees under convex piecewise-linear cost function
- The inverse 1-median problem on a cycle
- The uniform cost reverse 1-centdian location problem on tree networks with edge length reduction
- On the structure of the inverse-feasible region of a linear program
- Some variants of reverse selective center location problem on trees under the Chebyshev and Hamming norms
- Optimal algorithms for integer inverse undesirable \(p\)-median location problems on weighted extended star networks
- Reverse selective obnoxious center location problems on tree graphs
- The augmented Lagrangian method for a type of inverse quadratic programming problems over second-order cones
- Optimal algorithms for inverse obnoxious center location problems under the weighted Chebyshev and Hamming cost norms on networks
- The inverse 1-maxian problem with edge length modification
- The inverse Fermat-Weber problem
- An Oracle Strongly Polynomial Algorithm for Bottleneck Expansion Problems
- A majorized penalty approach to inverse linear second order cone programming problems
- Title not available (Why is that?)
- Reverse 2-median problem on trees
- A Punt Returner Location Problem
- Solving Nonlinear Single-Facility Network Location Problems
- Optimal algorithms for some inverse uncapacitated facility location problems on networks
- Inverse median problems
- Weight reduction problems with certain bottleneck objectives.
- A perturbation approach for a type of inverse linear programming problems
- Title not available (Why is that?)
- Linear time optimal approaches for reverse obnoxious center location problems on networks
- Combinatorial algorithms for reverse selective undesirable center location problems on cycle graphs
- The Minmax Regret Reverse 1-Median Problem on Trees with Uncertain Vertex Weights
- A perturbation approach for an inverse quadratic programming problem
- Title not available (Why is that?)
- Location Problems with Cutoff
- Robust reverse 1-center problems on trees with interval costs
- A perturbation approach for an inverse quadratic programming problem over second-order cones
- Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
- A class of bottleneck expansion problems
- Reverse maximum flow problem under the weighted Chebyshev distance
- A nonconvex ADMM for a class of sparse inverse semidefinite quadratic programming problems
- On the optimum capacity of capacity expansion problems
- An alternating direction method for solving a class of inverse semi-definite quadratic programming problems
- A penalty-type method for solving inverse optimal value problem in second-order conic programming
- Inverse and reverse balanced facility location problems with variable edge lengths on trees
- Complexity of some inverse shortest path lengths problems
This page was built for publication: Some reverse location problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1576337)
