The following pages link to Arie Tamir (Q176435):
Displaying 50 items.
- An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs (Q2564302) (← links)
- One-way and round-trip center location problems (Q2568335) (← links)
- Locating two obnoxious facilities using the weighted maximin criterion (Q2583716) (← links)
- Minimax Regret Single-Facility Ordered Median Location Problems on Networks (Q2901048) (← links)
- Minimax flow tree problems (Q3057112) (← links)
- Centdian Computation in Cactus Graphs (Q3143737) (← links)
- (Q3147662) (← links)
- A Class of Balanced Matrices Arising from Location Problems (Q3222208) (← links)
- The geometric maximum traveling salesman problem (Q3452505) (← links)
- New Results on Minimax Regret Single Facility Ordered Median Location Problems on Networks (Q3527215) (← links)
- Centdian Computation for Sensor Networks (Q3569075) (← links)
- (Q3606146) (← links)
- Finding Least-Distances Lines (Q3665109) (← links)
- New Results on the Complexity of <i>p</i>-Centre Problems (Q3670556) (← links)
- Optimization problems with algebraic solutions: Quadratic fractional programs and ratio games (Q3688122) (← links)
- A finite algorithm for the continuousp-center location problem on a graph (Q3724065) (← links)
- Efficient Algorithms for Optimization and Selection on Series-Parallel Graphs (Q3754451) (← links)
- On the Solution Value of the Continuous <i>p</i>-Center Location Problem on a Graph (Q3758534) (← links)
- The minimax multistop location problem on a tree (Q3787757) (← links)
- Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures (Q3792728) (← links)
- Maximizing Classes of Two-Parameter Objectives Over Matroids (Q3820617) (← links)
- Equivalent Mathematical Programming Formulations of Monotonic Tree Network Location Problems (Q3829319) (← links)
- Efficient Algorithms for a Selection Problem with Nested Constraints and Its Application to a Production-Sales Planning Model (Q3873922) (← links)
- The use of jacobi's lemma in unimodularity theory (Q3874342) (← links)
- An $O(n\log ^2 n)$ Algorithm for the <i>k</i>th Longest Path in a Tree with Applications to Location Problems (Q3906433) (← links)
- Polynomially bounded algorithms for locatingp-centers on a tree (Q3947422) (← links)
- An $O ( ( n\log p )^2 )$ Algorithm for the Continuous <i>p</i>-Center Problem on a Tree (Q3960131) (← links)
- Scheduling jobs to two machines subject to batch arrival ordering (Q3960455) (← links)
- Locating Centers on a Tree with Discontinuous Supply and Demand Regions (Q3964291) (← links)
- (Q3971521) (← links)
- Obnoxious Facility Location on Graphs (Q3985539) (← links)
- Distance-constrained multifacility minimax location problems on tree networks (Q3989543) (← links)
- The generalized <i>P</i>‐forest problem on a tree network (Q3993630) (← links)
- Minimal Length Curves That Are Not Embeddable in an Open Planar Set: The Problem of a Lost Swimmer with a Compass (Q4016757) (← links)
- On a tree-shaped facility location problem of Minieka (Q4021818) (← links)
- Technical Note—On the Complexity of Some Classes of Location Problems (Q4024323) (← links)
- Minimality and complementarity properties associated with Z-functions and M-functions (Q4042851) (← links)
- An Efficient One Dimensional Search Procedure (Q4068436) (← links)
- On the number of solutions to the linear comple-mentarity problem (Q4110798) (← links)
- Line Search Techniques Based on Interpolating Polynomials using Function Values Only (Q4125667) (← links)
- An Application of <i>Z</i>-Matrices to a Class of Resource Allocation Problems (Q4135249) (← links)
- Ergodicity and symmetric mathematical programs (Q4136973) (← links)
- An $O(N \cdot \log N)$ Algorithm for a Class of Matching Problems (Q4154057) (← links)
- The single facility location problem with minimum distance constraints (Q4228780) (← links)
- On a characterization of P-matrices (Q4402074) (← links)
- Exploiting self‐canceling demand point aggregation error for some planar rectilinear median location problems (Q4456087) (← links)
- Aggregation Error Bounds for a Class of Location Models (Q4530649) (← links)
- Worst-case incremental analysis for a class ofp-facility location problems (Q4537620) (← links)
- A polynomial algorithm for thep-centdian problem on a tree (Q4540080) (← links)
- OPTIMAL FACILITY LOCATION UNDER VARIOUS DISTANCE FUNCTIONS (Q4762912) (← links)
