Pages that link to "Item:Q816415"

The following pages link to Heuristic procedures for solving the discrete ordered median problem (Q816415):

Displaying 19 items.

• The ordered capacitated facility location problem (Q611009) (← links)
• On solving the planar \(k\)-centrum problem with Euclidean distances (Q613427) (← links)
• Genetic algorithms for solving the discrete ordered median problem (Q884020) (← links)
• A memetic algorithm for multi-objective dynamic location problems (Q960114) (← links)
• Variable neighbourhood search: methods and applications (Q970194) (← links)
• Convex ordered median problem with \(\ell _p\)-norms (Q1013404) (← links)
• A flexible model and efficient solution strategies for discrete location problems (Q1028444) (← links)
• Variable neighbourhood search: Methods and applications (Q1029572) (← links)
• Distribution systems design with role dependent objectives (Q1039797) (← links)
• A revised variable neighborhood search for the discrete ordered median problem (Q1634286) (← links)
• The probabilistic \(p\)-center problem: planning service for potential customers (Q1683071) (← links)
• Efficient solutions for the far from most string problem (Q1761847) (← 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)
• An extended covering model for flexible discrete and equity location problems (Q2379187) (← links)
• Ordered \(p\)-median problems with neighbourhoods (Q2419559) (← links)
• Exact procedures for solving the discrete ordered median problem (Q2499160) (← links)
• The \(p\)-facility ordered median problem on networks (Q2568602) (← links)
• A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem (Q3386785) (← links)