Pages that link to "Item:Q1060943"

The following pages link to A note on solving large p-median problems (Q1060943):

Displaying 38 items.

• OR-Library (Q16337) (← links)
• Variable neighborhood search for the pharmacy duty scheduling problem (Q337137) (← links)
• Local search heuristics for the mobile facility location problem (Q337654) (← links)
• J-means and I-means for minimum sum-of-squares clustering on networks (Q526420) (← links)
• Bee colony optimization for the \(p\)-center problem (Q632685) (← links)
• Complexity evaluation of benchmark instances for the \(p\)-median problem (Q636452) (← links)
• The \(p\)-median problem in fuzzy environment: proving fuzzy vertex optimality theorem and its application (Q780129) (← links)
• Enhancements to two exact algorithms for solving the vertex \(P\)-center problem (Q814956) (← links)
• Heuristic procedures for solving the discrete ordered median problem (Q816415) (← links)
• A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation (Q863991) (← links)
• The \(p\)-median problem: a survey of metaheuristic approaches (Q864013) (← links)
• Computational study of large-scale \(p\)-median problems (Q868446) (← links)
• A method for solving to optimality uncapacitated location problems (Q920004) (← links)
• New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems (Q959511) (← links)
• A computational evaluation of a general branch-and-price framework for capacitated network location problems (Q1026595) (← links)
• Stabilized column generation (Q1297485) (← links)
• A heuristic for large-size \(p\)-median location problems with application to school location (Q1339149) (← links)
• Location and layout planning. A survey (Q1372765) (← links)
• A revised variable neighborhood search for the discrete ordered median problem (Q1634286) (← links)
• Making a state-of-the-art heuristic faster with data mining (Q1639223) (← links)
• A Lagrangian search method for the \(P\)-median problem (Q1675643) (← links)
• The incremental cooperative design of preventive healthcare networks (Q1730637) (← links)
• Lagrangean heuristics for location problems (Q1804069) (← links)
• Dominant, an algorithm for the \(p\)-center problem. (Q1811146) (← links)
• Design and analysis of hybrid metaheuristics for the reliability \(p\)-median problem (Q1926910) (← links)
• Parallel iterative solution-based Tabu search for the obnoxious \(p\)-median problem (Q2027024) (← links)
• A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks (Q2053830) (← links)
• A branch-and-price approach for the continuous multifacility monotone ordered median problem (Q2106721) (← links)
• On cutting planes for cardinality-constrained linear programs (Q2330656) (← links)
• Variable neighborhood search for minimum sum-of-squares clustering on networks (Q2355953) (← links)
• Clustering with or without the approximation (Q2377383) (← links)
• BEAMR: an exact and approximate model for the \(p\)-median problem (Q2384887) (← links)
• A fast swap-based local search procedure for location problems (Q2480210) (← links)
• An exact algorithm for the capacitated vertex \(p\)-center problem (Q2496034) (← links)
• Solving the \(p\)-median problem with pos/neg weights by variable neighborhood search and some results for special cases (Q2572249) (← links)
• Solving the \(p\)-median problem on regular and lattice networks (Q2664388) (← links)
• A Branch Decomposition Algorithm for the <i>p</i>-Median Problem (Q4599316) (← links)
• A hybrid data mining metaheuristic for the <i>p</i>‐median problem (Q4969775) (← links)