Pages that link to "Item:Q709204"

The following pages link to Single-allocation ordered median hub location problems (Q709204):

Displaying 18 items.

• Robust optimization approach to capacitated single and multiple allocation hub location problems (Q291363) (← links)
• Hub location under competition (Q322435) (← links)
• When centers can fail: a close second opportunity (Q337641) (← links)
• Exact algorithms for handling outliers in center location problems on networks using \(k\)-max functions (Q1622795) (← links)
• A comparative study of formulations and solution methods for the discrete ordered \(p\)-median problem (Q1652079) (← links)
• A new approach to optimize a hub covering location problem with a queue estimation component using genetic programming (Q1797769) (← links)
• Proprietor and customer costs in the incomplete hub location-routing network topology (Q1991436) (← links)
• Perspectives on modeling hub location problems (Q2029941) (← links)
• An exact completely positive programming formulation for the discrete ordered median problem: an extended version (Q2176282) (← links)
• A fresh view on the discrete ordered median problem based on partial monotonicity (Q2189878) (← 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)
• A specialized branch \& bound \& cut for single-allocation ordered median hub location problems (Q2444555) (← links)
• A comparative study of different formulations for the capacitated discrete ordered median problem (Q2664433) (← links)
• A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem (Q3386785) (← links)
• On hub location problems in geographically flexible networks (Q6071054) (← links)
• Formulations and valid inequalities for the capacitated dispersion problem (Q6179719) (← links)