Pages that link to "Item:Q1162434"

The following pages link to A tree search algorithm for the p-median problem (Q1162434):

Displaying 24 items.

• Online facility location with facility movements (Q539473) (← links)
• Facility location models for distribution system design (Q707128) (← links)
• Analysis of decomposition algorithms with Benders cuts for \(p\)-median problem (Q853803) (← links)
• Computational study of large-scale \(p\)-median problems (Q868446) (← links)
• A method for solving to optimality uncapacitated location problems (Q920004) (← links)
• Optimal partitioning of a data set based on the \(p\)-median model (Q946677) (← 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)
• Clustering search algorithm for the capacitated centered clustering problem (Q1038295) (← links)
• A comparison of two dual-based procedures for solving the p-median problem (Q1058960) (← links)
• A note on solving large p-median problems (Q1060943) (← links)
• 'Multidimensional' extensions and a nested dual approach for the m-median problem (Q1072925) (← links)
• On the exact solution of large-scale simple plant location problems (Q1121152) (← links)
• Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem (Q1171987) (← links)
• A dynamic programming heuristic for the \(P\)-median problem (Q1278985) (← links)
• Algorithms for a multi-level network optimization problem (Q1307817) (← links)
• Analyzing tradeoffs between zonal constraints and accessibility in facility location (Q1317094) (← links)
• Incorporating neighborhood reduction for the solution of the planar \(p\)-median problem (Q1686519) (← links)
• A branch-and-price approach to \(p\)-median location problems (Q1764773) (← links)
• An improved Lagrangian relaxation and dual ascent approach to facility location problems (Q1789574) (← links)
• Lagrangean heuristics for location problems (Q1804069) (← links)
• On cutting planes for cardinality-constrained linear programs (Q2330656) (← links)
• A neural model for the \(p\)-median problem (Q2384886) (← links)
• Hybrid scatter search and path relinking for the capacitated \(p\)-median problem (Q2570156) (← links)