Pages that link to "Item:Q1917237"

The following pages link to A multifacility location problem on median spaces (Q1917237):

Displaying 22 items.

• Continuous multifacility ordered median location problems (Q322399) (← links)
• The multi-facility median problem with Pos/Neg weights on general graphs (Q609818) (← links)
• The multi-story space assignment problem (Q610966) (← links)
• Determination of \(\text{msd}(L^n)\) (Q1283456) (← links)
• Locating a facility on a network with multiple median-type objectives (Q1290146) (← links)
• Computing a median point of a simple rectilinear polygon (Q1321814) (← links)
• Sorting weighted distances with applications to objective function evaluations in single facility location problems. (Q1426729) (← links)
• A characterization of minimizable metrics in the multifacility location problem (Q1582478) (← links)
• Hard cases of the multifacility location problem (Q1887076) (← links)
• Minimum 0-extension problems on directed metrics (Q2042078) (← links)
• The multicriteria \(p\)-facility median location problem on networks (Q2256313) (← links)
• One more well-solved case of the multifacility location problem (Q2386213) (← links)
• Weakly Modular Graphs and Nonpositive Curvature (Q3380549) (← links)
• A SHORTEST PATH APPROACH TO A MULTIFACILITY MINIMAX LOCATION PROBLEM WITH RECTILINEAR DISTANCES (Q3705191) (← links)
• (Q4229620) (← links)
• Solving Structured Multifacility Location Problems Efficiently (Q4302927) (← links)
• The Multimedian Location Problem on a Network Exploiting Block Structure (Q4302928) (← links)
• Discrete Convex Functions on Graphs and Their Algorithmic Applications (Q4689627) (← links)
• On condorcet and median points of simple rectilinear polygons (Q5055889) (← links)
• (Q5089214) (← links)
• Discrete convexity and polynomial solvability in minimum 0-extension problems (Q5962712) (← links)
• Optimality of the coordinate-wise median mechanism for strategyproof facility location in two dimensions (Q6116312) (← links)