Pages that link to "Item:Q1413747"

The following pages link to An efficient genetic algorithm for the \(p\)-median problem (Q1413747):

Displaying 50 items.

• A differential evolution algorithm for finding the median ranking under the Kemeny axiomatic approach (Q62336) (← links)
• Metaheuristic applications on discrete facility location problems: a survey (Q260627) (← links)
• Variable neighborhood search for the pharmacy duty scheduling problem (Q337137) (← links)
• New heuristic algorithms for solving the planar \(p\)-median problem (Q337669) (← links)
• A new heuristic for solving the \(p\)-median problem in the plane (Q339602) (← links)
• The \(r\)-interdiction median problem with probabilistic protection and its solution algorithm (Q339605) (← links)
• The maximin gradual cover location problem (Q480773) (← links)
• An effective heuristic for the \(P\)-median problem with application to ambulance location (Q505139) (← links)
• New genetic algorithms based approaches to continuous \(p\)-median problem (Q539099) (← links)
• Tuned genetic algorithms for finding \(p\)-medians of a weighted graph (Q554210) (← links)
• A genetic algorithm for solving a capacitated \(p\)-median problem (Q596685) (← links)
• Multiobjective optimization for multimode transportation problems (Q721075) (← links)
• Model-based capacitated clustering with posterior regularization (Q724144) (← links)
• The \(p\)-median problem in fuzzy environment: proving fuzzy vertex optimality theorem and its application (Q780129) (← links)
• A genetic algorithm approach for regrouping service sites (Q817228) (← 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)
• A scatter search-based heuristic to locate capacitated transshipment points (Q878590) (← links)
• A branch-and-cut method for the obnoxious \(p\)-median problem (Q926563) (← links)
• Optimizing the location of a production firm (Q993460) (← links)
• A GIS-based optimization framework for competitive multi-facility location-routing problem (Q993466) (← links)
• A genetic algorithm for a single product network design model with lead time and safety stock considerations (Q1014964) (← links)
• Optimal location with equitable loads (Q1026600) (← links)
• Exemplar-based clustering via simulated annealing (Q1036142) (← links)
• The planar multifacility collection depots location problem (Q1628125) (← links)
• The Weber obnoxious facility location model: a big arc small arc approach (Q1651661) (← 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)
• Scheduling quay cranes and yard trucks for unloading operations in container ports (Q1730674) (← links)
• Hybrid genetic algorithms with selective crossover for the capacitated \(p\)-Median problem (Q1788935) (← links)
• Solving large-scale maximum expected covering location problems by genetic algorithms: a comparative study (Q1847206) (← links)
• Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems (Q1915982) (← links)
• Design and analysis of hybrid metaheuristics for the reliability \(p\)-median problem (Q1926910) (← links)
• Designing a supply chain network under the risk of disruptions (Q1954554) (← links)
• Directional approach to gradual cover: the continuous case (Q2033708) (← links)
• \(k\)-means genetic algorithms with greedy genetic operators (Q2217036) (← links)
• Hybrid biobjective evolutionary algorithms for the design of a hospital waste management network (Q2271121) (← links)
• Solving multiple facilities location problems with separated clusters (Q2294344) (← links)
• A branch and cut algorithm for the hierarchical network design problem (Q2379520) (← links)
• A bibliography for some fundamental problem categories in discrete location science (Q2384836) (← links)
• A neural model for the \(p\)-median problem (Q2384886) (← links)
• GASUB: finding global optima to discrete location problems by a genetic-like algorithm (Q2460125) (← links)
• An ant colony algorithm for the pos/neg weighted \(p\)-median problem (Q2461260) (← links)
• A bilevel mixed-integer program for critical infrastructure protection planning (Q2462537) (← links)
• An exact solution approach for the interdiction median problem with fortification (Q2477666) (← links)
• A multi-objective integrated facility location-hardening model: analyzing the pre- and post-disruption tradeoff (Q2514827) (← links)
• Heuristic algorithms for siting alternative-fuel stations using the flow-refueling location model (Q2654319) (← links)
• Solving the \(p\)-median problem on regular and lattice networks (Q2664388) (← links)
• Solving the simple plant location problem by genetic algorithm (Q2765605) (← links)
• Pharmacy duty scheduling problem (Q2811939) (← links)