Pages that link to "Item:Q4346224"

The following pages link to Simpson Points in Planar Problems with Locational Constraints. The Polyhedral-Gauge Case (Q4346224):

Displaying 12 items.

• A generalized Weber problem with different gauges for different regions (Q278331) (← links)
• The discrete facility location problem with balanced allocation of customers (Q631097) (← links)
• A comparison of formulations and solution methods for the minimum-envy location problem (Q1000990) (← links)
• Asymmetric distances, semidirected networks and majority in Fermat-Weber problems (Q1026590) (← links)
• Efficiency in constrained continuous location (Q1291655) (← links)
• A variational inequality approach for constrained multifacility Weber problem under gauge (Q1717019) (← links)
• Relaxation of the Condorcet and Simpson conditions in voting location (Q1869503) (← links)
• ADMM-type methods for generalized multi-facility Weber problem (Q2076464) (← 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)
• Quasiconvex constrained multicriteria continuous location problems: structure of nondominated solution sets (Q2456634) (← links)
• An improved implementation and analysis of the Diaz and O'Rourke algorithm for finding the Simpson point of a convex polygon (Q5852137) (← links)