Pages that link to "Item:Q1762151"

The following pages link to An aggregation heuristic for large scale p-median problem (Q1762151):

Displaying 19 items.

• A model for clustering data from heterogeneous dissimilarities (Q323236) (← links)
• A quadtree-based allocation method for a class of large discrete Euclidean location problems (Q337393) (← links)
• Demand point aggregation method for covering problems with gradual coverage (Q337550) (← links)
• Threshold robustness in discrete facility location problems: a bi-objective approach (Q499687) (← links)
• Solving large \(p\)-median problems by a multistage hybrid approach using demand points aggregation and variable neighbourhood search (Q887197) (← links)
• A computational study of a nonlinear minsum facility location problem (Q1761206) (← links)
• An optimization and simulation approach to emergency stations relocation (Q1999518) (← links)
• Near-optimal large-scale k-medoids clustering (Q2054038) (← links)
• The min-p robust optimization approach for facility location problem under uncertainty (Q2165274) (← links)
• \(k\)-means genetic algorithms with greedy genetic operators (Q2217036) (← links)
• An adaptive multiphase approach for large unconditional and conditional \(p\)-median problems (Q2253990) (← links)
• Solving the \(p\)-median problem on regular and lattice networks (Q2664388) (← links)
• A matheuristic for large-scale capacitated clustering (Q2668749) (← links)
• Pharmacy duty scheduling problem (Q2811939) (← links)
• A Branch Decomposition Algorithm for the <i>p</i>-Median Problem (Q4599316) (← links)
• Principal points analysis via <i>p</i>-median problem for binary data (Q5037110) (← links)
• Discrete facility location in machine learning (Q5100135) (← links)
• The balanced \(p\)-median problem with unitary demand (Q6164621) (← links)
• An efficient Benders decomposition for the \(p\)-median problem (Q6167396) (← links)