Pages that link to "Item:Q3705189"

The following pages link to Using Block Norms for Location Modeling (Q3705189):

Displaying 50 items.

• A generalized Weber problem with different gauges for different regions (Q278331) (← links)
• Robust solutions to multi-facility Weber location problem under interval and ellipsoidal uncertainty (Q279517) (← links)
• A planar single facility location and border crossing problem (Q339663) (← links)
• Generalized light robustness and the trade-off between robustness and nominal quality (Q471020) (← links)
• Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem (Q490197) (← links)
• Continuous location under the effect of `refraction' (Q507312) (← links)
• Numerical optimization method for packing regular convex polygons (Q519665) (← links)
• Geometric fit of a point set by generalized circles (Q652655) (← links)
• The geometry of optimal partitions in location problems (Q683940) (← links)
• A destination optimality in asymmetric distance Fermat-Weber problems (Q689258) (← links)
• Minsum hyperspheres in normed spaces (Q713318) (← links)
• Locating a general minisum `circle' on the plane (Q766255) (← links)
• A single facility stochastic location problem under A-distance (Q809889) (← links)
• Planar location problems with block distance and barriers (Q816413) (← links)
• The \(K\)-connection location problem in a plane (Q816418) (← links)
• Finite and infinitesimal rigidity with polyhedral norms (Q894682) (← links)
• The general optimal market area model (Q919999) (← links)
• Determination of efficient solutions for point-objective locational decision problems (Q920025) (← links)
• Asymmetric distances, semidirected networks and majority in Fermat-Weber problems (Q1026590) (← links)
• A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations (Q1042058) (← links)
• Solving general continuous single facility location problems by cutting planes (Q1086129) (← links)
• Localization in multifacility location theory (Q1095778) (← links)
• The minimax center estimation problem for automated roundness inspection (Q1118528) (← links)
• Was Euclid an unnecessarily sophisticated psychologist? (Q1205750) (← links)
• Practical aspects of route planning for magazine and newspaper wholesalers (Q1266509) (← links)
• Parametric distance functions vs. nonparametric neural networks for estimating road travel distances (Q1268152) (← links)
• Weber problems with alternative transportation systems (Q1278584) (← links)
• Some personal views on the current state and the future of locational analysis (Q1291654) (← links)
• Restricted center problems under polyhedral gauges (Q1291660) (← links)
• A deep cut ellipsoid algorithm for convex programming: Theory and applications (Q1315434) (← links)
• Nondifferentiability detection and dimensionality reduction in minisum multifacility location problems (Q1367722) (← links)
• Locating hyperplanes to fitting set of points: a general framework (Q1652646) (← links)
• A variational inequality approach for constrained multifacility Weber problem under gauge (Q1717019) (← links)
• A biobjective approach to recoverable robustness based on location planning (Q1753588) (← links)
• Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem (Q1761969) (← links)
• Facility location problems with uncertainty on the plane (Q1779686) (← links)
• Approximation of solutions for location problems (Q1821683) (← links)
• Planar multifacility location problems with tree structure and finite dominating sets (Q2010913) (← links)
• Covering problems with polyellipsoids: a location analysis perspective (Q2028797) (← links)
• ADMM-type methods for generalized multi-facility Weber problem (Q2076464) (← links)
• A branch-and-price approach for the continuous multifacility monotone ordered median problem (Q2106721) (← links)
• Generating valid linear inequalities for nonlinear programs via sums of squares (Q2198537) (← links)
• A new local search for continuous location problems (Q2255938) (← links)
• Simultaneous scheduling and location (ScheLoc): The planar ScheLoc makespan problem (Q2268516) (← links)
• An ADMM-based location-allocation algorithm for nonconvex constrained multi-source Weber problem under gauge (Q2307752) (← links)
• A heuristic algorithm for constrained multi-source location problem with closest distance under gauge: the variational inequality approach (Q2318909) (← links)
• Directional bias of the \(l_ p\)-norm (Q2367375) (← links)
• A unified model for Weber problems with continuous and network distances (Q2384880) (← links)
• Ordered \(p\)-median problems with neighbourhoods (Q2419559) (← links)
• Learning with optimal interpolation norms (Q2420165) (← links)