The following pages link to (Q4203976):
Displaying 50 items.
- Backup multifacility location problem with \(l_p\) norm (Q260687) (← links)
- Robust solutions to multi-facility Weber location problem under interval and ellipsoidal uncertainty (Q279517) (← links)
- New approximation algorithms for the unsplittable capacitated facility location problem (Q300454) (← links)
- On Newton's method for the Fermat-Weber location problem (Q306303) (← links)
- The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance (Q326486) (← links)
- Accelerating convergence in minisum location problem with \(\ell p\) norms (Q336624) (← links)
- GRASP for the uncapacitated \(r\)-allocation \(p\)-hub median problem (Q336883) (← links)
- Recovery-to-optimality: a new two-stage approach to robustness with an application to aperiodic timetabling (Q337170) (← links)
- Comparison of Condorcet and Weber solutions on a plane: social choice versus centralization (Q337680) (← links)
- A new heuristic for solving the \(p\)-median problem in the plane (Q339602) (← links)
- On a facility location problem with applications to tele-diagnostic (Q360498) (← links)
- Accelerating the convergence in the single-source and multi-source Weber problems (Q428088) (← links)
- A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand (Q429526) (← links)
- On the use of the varignon frame for single facility Weber problems in the presence of convex barriers (Q439364) (← links)
- Sequential competitive location on networks (Q439407) (← links)
- Gate points in continuous location between regions with different \(\ell _{p}\) norms (Q439558) (← links)
- Locating an axis-parallel rectangle on a Manhattan plane (Q458948) (← links)
- The wisdom of voters: evaluating the Weber objective in the plane at the Condorcet solution (Q512989) (← links)
- Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees (Q534329) (← links)
- On the structure of the solution set for the single facility location problem with average distances (Q543416) (← links)
- A BSSS algorithm for the location problem with minimum square error (Q606175) (← links)
- On solving the planar \(k\)-centrum problem with Euclidean distances (Q613427) (← links)
- Cooperative games in facility location situations with regional fixed costs (Q628664) (← links)
- Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods (Q632389) (← links)
- Geometric fit of a point set by generalized circles (Q652655) (← links)
- Local convergence in a generalized Fermat-Weber problem (Q689230) (← links)
- Probabilistic \(l_ p\) distances in location models (Q689232) (← links)
- Forecast horizons and dynamic facility location planning (Q689237) (← links)
- A note on the Weber location problem (Q689238) (← links)
- Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP (Q689251) (← links)
- Demand sensitivity to space-price competition with Manhattan and Euclidean representations of distance (Q689262) (← links)
- Facility location models for distribution system design (Q707128) (← links)
- Planar expropriation problem with non-rigid rectangular facilities (Q709112) (← links)
- Minsum hyperspheres in normed spaces (Q713318) (← links)
- Solving scheduling and location problems in the plane simultaneously (Q732883) (← links)
- Probabilistic d-clustering (Q734358) (← links)
- Heuristics for the p-hub location problem (Q803033) (← links)
- A single facility stochastic location problem under A-distance (Q809889) (← links)
- Maximizing trip coverage in the location of a single rapid transit alignment (Q816407) (← links)
- A continuous location-allocation problem with zone-dependent fixed cost (Q816411) (← links)
- A genetic algorithm approach for regrouping service sites (Q817228) (← links)
- New simple and efficient heuristics for the uncapacitated single allocation hub location problem (Q833533) (← links)
- Detailed layout planning for irregularly-shaped machines with transportation path design (Q856265) (← links)
- The \(p\)-median problem: a survey of metaheuristic approaches (Q864013) (← links)
- The transfer point location problem (Q864017) (← links)
- Placing a finite size facility with a center objective on a rectangular plane with barriers (Q864036) (← links)
- Duality for location problems with unbounded unit balls (Q864045) (← links)
- The \(p/q\)-\texttt{ACTIVE} uncapacitated facility location problem: investigation of the solution space and an LP-fitting heuristic (Q869586) (← links)
- Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem (Q879279) (← links)
- Covering point sets with two disjoint disks or squares (Q929745) (← links)
