Pages that link to "Item:Q2572249"
From MaRDI portal
The following pages link to Solving the \(p\)-median problem with pos/neg weights by variable neighborhood search and some results for special cases (Q2572249):
Displaying 15 items.
- Optimizing frequent time-window selection for association rules mining in a temporal database using a variable neighbourhood search (Q337219) (← links)
- Variable neighborhood search for location routing (Q339539) (← links)
- A Lagrangian heuristic algorithm for a public healthcare facility location problem (Q363567) (← links)
- The multi-facility median problem with Pos/Neg weights on general graphs (Q609818) (← links)
- Solving the unconstrained optimization problem by a variable neighborhood search (Q864633) (← links)
- A genetic algorithm for the \(p\)-median problem with pos/neg weights (Q865554) (← links)
- An effective VNS for the capacitated \(p\)-median problem (Q932177) (← links)
- Variable neighbourhood search: methods and applications (Q970194) (← links)
- A branch and bound algorithm for determining locations of long-term care facilities (Q976416) (← links)
- Variable neighbourhood search: Methods and applications (Q1029572) (← links)
- A Lagrangian search method for the \(P\)-median problem (Q1675643) (← links)
- A hybrid artificial bee colony algorithm for the \(p\)-median problem with positive/negative weights (Q1684321) (← links)
- A modified firefly algorithm for general inverse \(p\)-Median location problems under different distance norms (Q1788861) (← links)
- Variable neighbourhood structures for cycle location problems (Q1926979) (← links)
- An ant colony algorithm for the pos/neg weighted \(p\)-median problem (Q2461260) (← links)