Pages that link to "Item:Q868446"

The following pages link to Computational study of large-scale \(p\)-median problems (Q868446):

Displaying 50 items.

• Irregular polyomino tiling via integer programming with application in phased array antenna design (Q288219) (← links)
• Public service system design with fuzzy parameters of perceived utility (Q301934) (← links)
• Local search heuristics for the mobile facility location problem (Q337654) (← links)
• Semi-Lagrangian relaxation applied to the uncapacitated facility location problem (Q434153) (← links)
• Data aggregation for \(p\)-median problems (Q491200) (← links)
• The location-dispatching problem: polyhedral results and content delivery network design (Q496706) (← links)
• Using dual feasible functions to construct fast lower bounds for routing and location problems (Q499343) (← links)
• Threshold robustness in discrete facility location problems: a bi-objective approach (Q499687) (← links)
• Complexity evaluation of benchmark instances for the \(p\)-median problem (Q636452) (← links)
• Algorithms for the one-dimensional two-stage cutting stock problem (Q724047) (← links)
• A cutting plane algorithm for the capacitated facility location problem (Q842775) (← links)
• The directional \(p\)-median problem: definition, complexity, and algorithms (Q864030) (← links)
• On the \(p\)-median polytope of \(Y\)-free graphs (Q951093) (← links)
• A computational evaluation of a general branch-and-price framework for capacitated network location problems (Q1026595) (← links)
• Exemplar-based clustering via simulated annealing (Q1036142) (← links)
• A note on solving large p-median problems (Q1060943) (← links)
• A decomposition approach for the \(p\)-median problem on disconnected graphs (Q1652380) (← links)
• Primal and dual bounds for the vertex \(p\)-median problem with balance constraints (Q1686518) (← links)
• Benders decomposition and column-and-row generation for solving large-scale linear programs with column-dependent-rows (Q1694312) (← links)
• A computational study of a nonlinear minsum facility location problem (Q1761206) (← links)
• An aggregation heuristic for large scale p-median problem (Q1762151) (← links)
• Semi-fair design of emergency service system with failing centers (Q1788937) (← links)
• An improved Lagrangian relaxation and dual ascent approach to facility location problems (Q1789574) (← links)
• Some heuristic methods for solving \(p\)-median problems with a coverage constraint (Q1926741) (← links)
• An exact column-generation approach for the lot-type design problem (Q1979196) (← links)
• Efficient incrementing heuristics for generalized \(p\)-location problems (Q2051202) (← links)
• A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks (Q2053830) (← 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)
• Convex fuzzy \(k\)-medoids clustering (Q2219180) (← links)
• Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems (Q2267294) (← links)
• A tighter formulation of the \(p\)-median problem (Q2268764) (← links)
• Finding all pure strategy Nash equilibria in a planar location game (Q2275630) (← links)
• Variable neighborhood search for minimum sum-of-squares clustering on networks (Q2355953) (← links)
• Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows (Q2434985) (← links)
• A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes (Q2481606) (← links)
• A branch-and-cut algorithm for the median-path problem (Q2490367) (← links)
• An Exact Algorithm for Blockmodeling of Two-Mode Network Data (Q2857671) (← links)
• The location-dispatching problem: polyhedral results and content delivery network design (Q2861504) (← links)
• Using decomposition to improve greedy solutions of the optimal diversity management problem (Q2862154) (← links)
• A computational study for the \(p\)-median problem (Q2883594) (← links)
• Solving large \(p\)-median problems with a radius formulation (Q2899146) (← links)
• A Computational Study of the Pseudo-Boolean Approach to the p-Median Problem Applied to Cell Formation (Q3091534) (← links)
• A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem (Q3386785) (← links)
• Scenario Reduction Techniques in Stochastic Programming (Q3646114) (← links)
• A Branch Decomposition Algorithm for the <i>p</i>-Median Problem (Q4599316) (← links)
• <i>K</i>-medoids inverse regression (Q5077871) (← links)
• Discrete facility location in machine learning (Q5100135) (← links)
• Discrete self-organizing migration algorithm and p-location problems (Q5147667) (← links)