Pages that link to "Item:Q926563"
From MaRDI portal
The following pages link to A branch-and-cut method for the obnoxious \(p\)-median problem (Q926563):
Displaying 19 items.
- The maximin HAZMAT routing problem (Q299771) (← links)
- Capacitated \(p\)-center problem with failure foresight (Q319964) (← links)
- Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem (Q322911) (← links)
- Closest assignment constraints in discrete location problems (Q439609) (← links)
- A comparison of formulations and solution methods for the minimum-envy location problem (Q1000990) (← links)
- A branch-and-price approach to \(p\)-median location problems (Q1764773) (← links)
- Parallel iterative solution-based Tabu search for the obnoxious \(p\)-median problem (Q2027024) (← links)
- The conditional \(p\)-dispersion problem (Q2046325) (← links)
- Alternative formulations for the obnoxious \(p\)-median problem (Q2217491) (← links)
- The obnoxious facilities planar \(p\)-median problem (Q2241906) (← links)
- Customer allocation in maximum capture problems (Q2392543) (← links)
- Facility location under service level constraints for heterogeneous customers (Q2399319) (← links)
- A branch-and-cut algorithm for the median-path problem (Q2490367) (← links)
- A strengthened formulation for the simple plant location problem with order (Q2643785) (← links)
- A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem (Q3386785) (← links)
- Less is more approach: basic variable neighborhood search for the obnoxious <i>p</i>‐median problem (Q6066720) (← links)
- A parallel variable neighborhood search approach for the obnoxious <i>p</i>‐median problem (Q6088247) (← links)
- A matheuristic for locating obnoxious facilities (Q6568397) (← links)
- An iterated greedy algorithm with variable reconstruction size for the obnoxious \(p\)-median problem (Q6609705) (← links)
