Pages that link to "Item:Q1026590"

The following pages link to Asymmetric distances, semidirected networks and majority in Fermat-Weber problems (Q1026590):

Displaying 18 items.

• A generalized Weber problem with different gauges for different regions (Q278331) (← links)
• How bad can the centroid be? (Q322839) (← links)
• Linear separation and approximation by minimizing the sum of concave functions of distances (Q457295) (← links)
• Asymmetric empirical similarity (Q459404) (← links)
• A variational inequality approach for constrained multifacility Weber problem under gauge (Q1717019) (← links)
• Pasting gauges. I: Shortest paths across a hyperplane (Q1728102) (← links)
• Maximizing upgrading and downgrading margins for ordinal regression (Q1935916) (← links)
• Symmetrically connected and antisymmetrically connected \(T_0\)-quasi-metric extensions (Q1987231) (← links)
• ADMM-type methods for generalized multi-facility Weber problem (Q2076464) (← links)
• Certain observations on antisymmetric \(T_0\)-quasi-metric spaces (Q2077298) (← links)
• Rejoinder on: ``Distance geometry and data science'' (Q2192024) (← links)
• Using the power of ideal solutions: simple proofs of some old and new results in location theory (Q2240676) (← links)
• Almost isometries of non-reversible metrics with applications to stationary spacetimes (Q2255875) (← 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)
• Locating a median line with partial coverage distance (Q2349526) (← links)
• Principle component analysis: robust versions (Q2399473) (← links)
• A Variational Inequality-Based Location-Allocation Algorithm for Locating Multiple Interactive Facilities (Q6053498) (← links)