Pages that link to "Item:Q1926741"
From MaRDI portal
The following pages link to Some heuristic methods for solving \(p\)-median problems with a coverage constraint (Q1926741):
Displaying 6 items.
- A model for clustering data from heterogeneous dissimilarities (Q323236) (← links)
- A distribution network design problem in the automotive industry: MIP formulation and heuristics (Q337173) (← links)
- Synthetic optimization model and algorithm for railway freight center station location and wagon flow organization problem (Q1717930) (← links)
- Variants of the \(\varepsilon\)-constraint method for biobjective integer programming problems: application to \(p\)-median-cover problems (Q1750397) (← links)
- A multi-product production/distribution system design problem with direct shipments and lateral transshipments (Q2005789) (← links)
- Better guarantees for \(k\)-median with service installation costs (Q2672628) (← links)
