Pages that link to "Item:Q884020"

The following pages link to Genetic algorithms for solving the discrete ordered median problem (Q884020):

Displaying 21 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)
• Tuned genetic algorithms for finding \(p\)-medians of a weighted graph (Q554210) (← links)
• The ordered capacitated facility location problem (Q611009) (← links)
• PCB assembly scheduling with alternative nozzle types for one component type (Q638019) (← links)
• Heuristic procedures for solving the discrete ordered median problem (Q816415) (← links)
• Computing the metric dimension of graphs by genetic algorithms (Q849088) (← links)
• An ILP formulation and genetic algorithm for the maximum degree-bounded connected subgraph problem (Q988336) (← links)
• Computing minimal doubly resolving sets of graphs (Q1013386) (← links)
• Distribution systems design with role dependent objectives (Q1039797) (← links)
• A revised variable neighborhood search for the discrete ordered median problem (Q1634286) (← links)
• A modified firefly algorithm for general inverse \(p\)-Median location problems under different distance norms (Q1788861) (← links)
• An exact completely positive programming formulation for the discrete ordered median problem: an extended version (Q2176282) (← links)
• A modified variable neighborhood search for the discrete ordered median problem (Q2256171) (← links)
• The ordered \(k\)-median problem: surrogate models and approximation algorithms (Q2316614) (← links)
• Ordered \(p\)-median problems with neighbourhoods (Q2419559) (← links)
• Variable neighborhood search for solving the balanced location problem (Q2840746) (← links)
• (Q3147661) (← links)
• A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem (Q3386785) (← links)
• (Q4383640) (← links)
• (Q4449755) (← links)