Pages that link to "Item:Q5252229"
From MaRDI portal
The following pages link to Facility Location with Matroid or Knapsack Constraints (Q5252229):
Displaying 13 items.
- Matroid and knapsack center problems (Q300451) (← links)
- A large class of facets for the \(K\)-median polytope (Q543406) (← links)
- Representative families for matroid intersections, with applications to location, packing, and covering problems (Q2028091) (← links)
- Approximation algorithms for the lower-bounded knapsack median problem (Q2039651) (← links)
- The distance-constrained matroid median problem (Q2182102) (← links)
- On some variants of Euclidean \(k\)-supplier (Q2670484) (← links)
- Improved Approximation Algorithms for Matroid and Knapsack Median Problems and Applications (Q2969635) (← links)
- (Q3044324) (← links)
- Locating Depots for Capacitated Vehicle Routing (Q3088097) (← links)
- Interpolating between \(k\)-median and \(k\)-center: approximation algorithms for ordered \(k\)-median (Q5002699) (← links)
- (Q5091192) (← links)
- The Euclidean <i>k</i>-Supplier Problem (Q5108254) (← links)
- Connected \(k\)-center and \(k\)-diameter clustering (Q6623593) (← links)
