Pages that link to "Item:Q2899146"

The following pages link to Solving large \(p\)-median problems with a radius formulation (Q2899146):

Displaying 42 items.

• Public service system design with fuzzy parameters of perceived utility (Q301934) (← links)
• A mixed integer linear model for clustering with variable selection (Q336929) (← links)
• A quadtree-based allocation method for a class of large discrete Euclidean location problems (Q337393) (← links)
• Balancing the arrival times of users in a two-stage location problem (Q512992) (← links)
• Multiobjective optimization for multimode transportation problems (Q721075) (← links)
• Computational study of large-scale \(p\)-median problems (Q868446) (← links)
• Solving large \(p\)-median problems by a multistage hybrid approach using demand points aggregation and variable neighbourhood search (Q887197) (← links)
• A note on solving large p-median problems (Q1060943) (← links)
• Scenario reduction for stochastic programs with conditional value-at-risk (Q1650782) (← links)
• Incorporating neighborhood reduction for the solution of the planar \(p\)-median problem (Q1686519) (← links)
• Mathematical models for stable matching problems with ties and incomplete lists (Q1737478) (← links)
• Semi-fair design of emergency service system with failing centers (Q1788937) (← links)
• Variable neighborhood search for metric dimension and minimal doubly resolving set problems (Q1926742) (← links)
• Design and analysis of hybrid metaheuristics for the reliability \(p\)-median problem (Q1926910) (← links)
• The stratified \(p\)-center problem (Q2003436) (← links)
• Efficient incrementing heuristics for generalized \(p\)-location problems (Q2051202) (← links)
• Near-optimal large-scale k-medoids clustering (Q2054038) (← links)
• A Lagrangian-based score for assessing the quality of pairwise constraints in semi-supervised clustering (Q2066643) (← links)
• A branch-and-price approach for the continuous multifacility monotone ordered median problem (Q2106721) (← links)
• Biologically inspired parent selection in genetic algorithms (Q2178305) (← links)
• A fresh view on the discrete ordered median problem based on partial monotonicity (Q2189878) (← links)
• Convex fuzzy \(k\)-medoids clustering (Q2219180) (← links)
• The complete vertex \(p\)-center problem (Q2219518) (← links)
• An adaptive multiphase approach for large unconditional and conditional \(p\)-median problems (Q2253990) (← links)
• Facility location with tree topology and radial distance constraints (Q2280295) (← links)
• Clustering and portfolio selection problems: a unified framework (Q2297578) (← links)
• An approximation algorithm for the facility location problem with lexicographic minimax objective (Q2336537) (← links)
• Facility location problems with user cooperation (Q2421328) (← links)
• Solving the \(p\)-median problem on regular and lattice networks (Q2664388) (← links)
• A comparative study of different formulations for the capacitated discrete ordered median problem (Q2664433) (← links)
• An Approximative Lexicographic Min-Max Approach to the Discrete Facility Location Problem (Q2806896) (← links)
• Mathematical Models and Search Algorithms for the Capacitated <i>p</i>-Center Problem (Q3386776) (← links)
• A Branch Decomposition Algorithm for the <i>p</i>-Median Problem (Q4599316) (← links)
• Convex Approach with Sub-gradient Method to Robust Service System Design (Q4685786) (← links)
• (Q5051496) (← links)
• Discrete facility location in machine learning (Q5100135) (← links)
• Discrete self-organizing migration algorithm and p-location problems (Q5147667) (← links)
• The exam location problem: mathematical formulations and variants (Q6065634) (← links)
• Dynamically second-preferred \(p\)-center problem (Q6106963) (← links)
• New formulations for two location problems with interconnected facilities (Q6128897) (← links)
• An efficient Benders decomposition for the \(p\)-median problem (Q6167396) (← links)
• Formulations and valid inequalities for the capacitated dispersion problem (Q6179719) (← links)