Pages that link to "Item:Q337669"
From MaRDI portal
The following pages link to New heuristic algorithms for solving the planar \(p\)-median problem (Q337669):
Displayed 12 items.
- The planar multifacility collection depots location problem (Q1628125) (← links)
- A distance-limited continuous location-allocation problem for spatial planning of decentralized systems (Q1651515) (← links)
- Incorporating neighborhood reduction for the solution of the planar \(p\)-median problem (Q1686519) (← links)
- Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems (Q1698283) (← links)
- A modified firefly algorithm for general inverse \(p\)-Median location problems under different distance norms (Q1788861) (← links)
- Classical and inverse median location problems under uncertain environment (Q1987593) (← links)
- Biologically inspired parent selection in genetic algorithms (Q2178305) (← links)
- A voltage drop limited decentralized electric power distribution network (Q2185525) (← links)
- The blockwise coordinate descent method for integer programs (Q2189480) (← links)
- \(k\)-means genetic algorithms with greedy genetic operators (Q2217036) (← links)
- Multi-facility green Weber problem (Q2333139) (← links)
- Improved starting solutions for the planar p-median problem (Q3388942) (← links)