The following pages link to Some reverse location problems (Q1576337):
Displaying 49 items.
- The augmented Lagrangian method for a type of inverse quadratic programming problems over second-order cones (Q458938) (← links)
- A perturbation approach for an inverse quadratic programming problem (Q607673) (← links)
- Locating facilities which interact: Some solvable cases (Q689235) (← links)
- The inverse 1-maxian problem with edge length modification (Q941835) (← links)
- Reverse 2-median problem on trees (Q943832) (← links)
- The inverse 1-median problem on a cycle (Q951097) (← links)
- The inverse Fermat-Weber problem (Q976390) (← links)
- Facility location problems in the plane based on reverse nearest neighbor queries (Q1038383) (← links)
- Location problems (Q1062596) (← links)
- Weight reduction problems with certain bottleneck objectives. (Q1417504) (← links)
- Reverse selective obnoxious center location problems on tree graphs (Q1650850) (← links)
- Upgrading the 1-center problem with edge length variables on a tree (Q1662640) (← links)
- Optimal algorithms for inverse vertex obnoxious center location problems on graphs (Q1685960) (← links)
- Combinatorial algorithms for reverse selective undesirable center location problems on cycle graphs (Q1697898) (← links)
- Reverse 1-maxian problem with keeping existing 1-median (Q1735954) (← links)
- The inverse optimal value problem (Q1769073) (← links)
- Optimal algorithms for integer inverse undesirable \(p\)-median location problems on weighted extended star networks (Q2033986) (← links)
- Assigning weights to minimize the covering radius in the plane (Q2331208) (← links)
- Inverse median problems (Q2386211) (← links)
- On the structure of the inverse-feasible region of a linear program (Q2417071) (← links)
- A majorized penalty approach to inverse linear second order cone programming problems (Q2438414) (← links)
- On the optimum capacity of capacity expansion problems (Q2472185) (← links)
- An alternating direction method for solving a class of inverse semi-definite quadratic programming problems (Q2515287) (← links)
- Inverse and reverse balanced facility location problems with variable edge lengths on trees (Q2656494) (← links)
- Reverse 1-center problem on weighted trees (Q2790878) (← links)
- Linear time optimal approaches for reverse obnoxious center location problems on networks (Q2836087) (← links)
- Complexity of some inverse shortest path lengths problems (Q3057164) (← links)
- Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees (Q3100698) (← links)
- Solving Nonlinear Single-Facility Network Location Problems (Q3757657) (← links)
- Improving the location of minimax facilities through network modification (Q4291483) (← links)
- A Punt Returner Location Problem (Q4545687) (← links)
- Reverse maximum flow problem under the weighted Chebyshev distance (Q4634311) (← links)
- Linear Time Optimal Approaches for Max-Profit Inverse 1-Median Location Problems (Q4689388) (← links)
- An Oracle Strongly Polynomial Algorithm for Bottleneck Expansion Problems (Q4806342) (← links)
- Some variants of reverse selective center location problem on trees under the Chebyshev and Hamming norms (Q4987701) (← links)
- Optimal algorithms for some inverse uncapacitated facility location problems on networks (Q5043849) (← links)
- Further Study on Reverse 1-Center Problem on Trees (Q5149548) (← links)
- A nonconvex ADMM for a class of sparse inverse semidefinite quadratic programming problems (Q5384603) (← links)
- A perturbation approach for a type of inverse linear programming problems (Q5391505) (← links)
- A perturbation approach for an inverse quadratic programming problem over second-order cones (Q5497021) (← links)
- Reverse 1-centre problem on trees under convex piecewise-linear cost function (Q5882838) (← links)
- A class of bottleneck expansion problems (Q5936134) (← links)
- The Minmax Regret Reverse 1-Median Problem on Trees with Uncertain Vertex Weights (Q6053538) (← links)
- Location Problems with Cutoff (Q6053539) (← links)
- Solving of the maxisum location problem on network with a restriction on transport costs (Q6081727) (← links)
- Inverse and reverse 2-facility location problems with equality measures on a network (Q6112991) (← links)
- The uniform cost reverse 1-centdian location problem on tree networks with edge length reduction (Q6159691) (← links)
- A penalty-type method for solving inverse optimal value problem in second-order conic programming (Q6546899) (← links)
- Robust reverse 1-center problems on trees with interval costs (Q6661114) (← links)
