Pages that link to "Item:Q932191"
From MaRDI portal
The following pages link to Complexity of local search for the \(p\)-median problem (Q932191):
Displaying 7 items.
- Threshold robustness in discrete facility location problems: a bi-objective approach (Q499687) (← links)
- Graph pricing with limited supply (Q832882) (← links)
- Berge-acyclic multilinear 0-1 optimization problems (Q1991264) (← links)
- Memetic algorithms: The polynomial local search complexity theory perspective (Q2481603) (← links)
- A Bilevel Competitive Location and Pricing Model with Nonuniform Split of Demand (Q4973258) (← links)
- The Branch and Cut Method for the Clique Partitioning Problem (Q4973260) (← links)
- Discrete facility location in machine learning (Q5100135) (← links)