Pages that link to "Item:Q1826490"

The following pages link to A hybrid heuristic for the \(p\)-median problem (Q1826490):

Displaying 50 items.

• Metaheuristic applications on discrete facility location problems: a survey (Q260627) (← links)
• Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem (Q322911) (← links)
• A model for clustering data from heterogeneous dissimilarities (Q323236) (← links)
• A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems (Q336709) (← links)
• GRASP and path relinking for the equitable dispersion problem (Q336711) (← links)
• A GRASP metaheuristic for microarray data analysis (Q336713) (← links)
• A GRASP with path-relinking heuristic for the survivable IP/MPLS-over-WSON multi-layer network optimization problem (Q336733) (← links)
• GRASP with evolutionary path-relinking for the capacitated arc routing problem (Q336740) (← links)
• Scatter search for an uncapacitated \(p\)-hub median problem (Q337508) (← links)
• New heuristic algorithms for solving the planar \(p\)-median problem (Q337669) (← links)
• Fast metaheuristics for the discrete \((r|p)\)-centroid problem (Q463377) (← links)
• An effective heuristic for the \(P\)-median problem with application to ambulance location (Q505139) (← links)
• Heuristic solution approaches for the maximum minsum dispersion problem (Q513174) (← links)
• A GRASP with evolutionary path relinking for the truck and trailer routing problem (Q632678) (← links)
• Vehicle driven approaches for non preemptive vehicle relocation with integrated quality criterion in a vehicle sharing system (Q829193) (← links)
• A hybrid multistart heuristic for the uncapacitated facility location problem (Q858329) (← 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)
• A genetic algorithm for the \(p\)-median problem with pos/neg weights (Q865554) (← links)
• Computational study of large-scale \(p\)-median problems (Q868446) (← links)
• A scatter search-based heuristic to locate capacitated transshipment points (Q878590) (← links)
• Meta-heuristic approaches with memory and evolution for a multi-product production/distribution system design problem (Q881527) (← links)
• Solving large \(p\)-median problems by a multistage hybrid approach using demand points aggregation and variable neighbourhood search (Q887197) (← links)
• Exemplar-based clustering via simulated annealing (Q1036142) (← links)
• GRASP and path relinking for the max-min diversity problem (Q1038285) (← links)
• Fast primal and dual heuristics for the \(p\)-median location problem (Q1176817) (← links)
• A dynamic programming heuristic for the \(P\)-median problem (Q1278985) (← links)
• A heuristic for large-size \(p\)-median location problems with application to school location (Q1339149) (← links)
• Making a state-of-the-art heuristic faster with data mining (Q1639223) (← links)
• A robust and scalable algorithm for the Steiner problem in graphs (Q1646683) (← links)
• A Lagrangian search method for the \(P\)-median problem (Q1675643) (← links)
• A hybrid artificial bee colony algorithm for the \(p\)-median problem with positive/negative weights (Q1684321) (← links)
• Median and covering location problems with interconnected facilities (Q1738812) (← links)
• Hybrid adaptive large neighborhood search for the optimal statistic median problem (Q1761216) (← links)
• Scatter search for the cutwidth minimization problem (Q1761768) (← links)
• An aggregation heuristic for large scale p-median problem (Q1762151) (← links)
• Some heuristic methods for solving \(p\)-median problems with a coverage constraint (Q1926741) (← links)
• Design and analysis of hybrid metaheuristics for the reliability \(p\)-median problem (Q1926910) (← links)
• GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times (Q1945095) (← links)
• A multi-product production/distribution system design problem with direct shipments and lateral transshipments (Q2005789) (← links)
• A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks (Q2053830) (← links)
• A variable neighborhood search approach for the vertex bisection problem (Q2201641) (← links)
• A novel ant colony optimization strategy for the quantum circuit compilation problem (Q2233514) (← links)
• A multi-objective GRASP procedure for reactive power compensation planning (Q2254191) (← links)
• A tighter formulation of the \(p\)-median problem (Q2268764) (← links)
• A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem (Q2344005) (← links)
• An ant colony algorithm for the pos/neg weighted \(p\)-median problem (Q2461260) (← links)
• A fast swap-based local search procedure for location problems (Q2480210) (← links)
• Solving the \(p\)-median problem on regular and lattice networks (Q2664388) (← links)
• Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem (Q2691195) (← links)