The following pages link to Arie Tamir (Q176435):
Displaying 50 items.
- Cooperative location games based on the minimum diameter spanning Steiner subgraph problem (Q423895) (← links)
- (Q584056) (redirect page) (← links)
- Algebraic optimization: The Fermat-Weber location problem (Q584057) (← links)
- On the minimum diameter spanning tree problem (Q673823) (← links)
- Linear time algorithms for some separable quadratic programming problems (Q688207) (← links)
- On the core of network synthesis games (Q757264) (← links)
- The nestedness property of the convex ordered median location problem on a tree (Q783030) (← links)
- On the integrality of an extreme solution to pluperfect graph and balanced systems (Q800230) (← links)
- Polynomial testing of the query ''Is \(a^ b\geq c^ d?''\) with application to finding a minimal cost reliability ratio spanning tree (Q800816) (← links)
- An optimal \(O(n\log n)\) algorithm for finding an enclosing planar rectilinear annulus of minimum width (Q833568) (← links)
- Minimum \(L_k\) path partitioning-an illustration of the Monge property (Q924884) (← links)
- Center location problems on tree graphs with subtree-shaped customers (Q1005232) (← links)
- Aggregation error for location models: Survey and analysis (Q1026594) (← links)
- Optimal location with equitable loads (Q1026600) (← links)
- Optimal algorithms for the path/tree-shaped facility location problems in trees (Q1031869) (← links)
- New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems (Q1038094) (← links)
- Minimum cost flow algorithms for series-parallel networks (Q1061597) (← links)
- Totally balanced and totally unimodular matrices defined by center location problems (Q1104945) (← links)
- On the core of a traveling salesman cost allocation game (Q1122517) (← links)
- On the solution of discrete bottleneck problems (Q1167061) (← links)
- Improved complexity bounds for location problems on the real line (Q1180820) (← links)
- A further note on market equilibrium with fixed supply (Q1248448) (← links)
- Fully polynomial approximation schemes for locating a tree-shaped facility: A generalization of the knapsack problem (Q1270784) (← links)
- A \(p\)-center grid-positioning aggregation procedure (Q1304506) (← links)
- A unifying location model on tree graphs based on submodularity property (Q1314341) (← links)
- Complexity results for the \(p\)-median problem with mutual communication (Q1317006) (← links)
- The least element property of center location on tree networks with applications to distance and precedence constrained problems (Q1319019) (← links)
- Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality (Q1321662) (← links)
- A distance constrained \(p\)-facility location problem on the real line (Q1340058) (← links)
- Approximation algorithms for maximum dispersion (Q1375119) (← links)
- A maximum \(b\)-matching problem arising from median location models with applications to the roommates problem (Q1380926) (← links)
- Structured \(p\)-facility location problems on the line solvable in polynomial time (Q1382805) (← links)
- Improved algorithms for several network location problems with equality measures. (Q1408453) (← links)
- Sorting weighted distances with applications to objective function evaluations in single facility location problems. (Q1426729) (← links)
- The centdian subtree on tree networks (Q1602695) (← links)
- The nestedness property of location problems on the line (Q1667399) (← links)
- Revisiting \(k\)-sum optimization (Q1675256) (← links)
- Locating tree-shaped facilities using the ordered median objective (Q1771313) (← links)
- Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem (Q1825115) (← links)
- Continuous bottleneck tree partitioning problems (Q1827846) (← links)
- On the complexity of locating linear facilities in the plane (Q1837617) (← links)
- Minimizing the sum of the \(k\) largest functions in linear time. (Q1853685) (← links)
- Algorithmic results for ordered median problems (Q1866979) (← links)
- A framework for demand point and solution space aggregation analysis for location models (Q1887955) (← links)
- Extensions to the Weber problem (Q2147049) (← links)
- A cooperative location game based on the 1-center location problem (Q2275823) (← links)
- A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks (Q2366611) (← links)
- Efficient algorithms for center problems in cactus networks (Q2371802) (← links)
- Improved algorithms for some competitive location centroid problems on paths, trees and graphs (Q2375952) (← links)
- On the planar piecewise quadratic 1-center problem (Q2379920) (← links)
