Pages that link to "Item:Q2413170"
From MaRDI portal
The following pages link to An approximation algorithm for the \(p\)-hub median problem (Q2413170):
Displaying 14 items.
- Efficient algorithms for the round-trip 1-center and 1-median problems (Q269488) (← links)
- Scatter search for an uncapacitated \(p\)-hub median problem (Q337508) (← links)
- The directional \(p\)-median problem: definition, complexity, and algorithms (Q864030) (← links)
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem (Q1291636) (← links)
- An approximation algorithm for the \(k\)-median problem with uniform penalties via pseudo-solution (Q1630998) (← links)
- An improved approximation algorithm for the prize-collecting red-blue median problem (Q2110701) (← links)
- Approximation algorithms for median hub location problems (Q2424817) (← links)
- An Approximation Algorithm for the k-Median Problem with Uniform Penalties via Pseudo-Solutions (Q2958344) (← links)
- An algorithm finding p-medians of a graph (Q3748084) (← links)
- Hub Location and the <i>p</i>-Hub Median Problem (Q4346344) (← links)
- A Modified Benders Method for the Single- and Multiple Allocation P-Hub Median Problems (Q4685749) (← links)
- Relevant Network Distances for Approximate Approach to Large p-Median Problems (Q5171787) (← links)
- A Self-stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives (Q5425962) (← links)
- An efficient Benders decomposition for the \(p\)-median problem (Q6167396) (← links)
