Pages that link to "Item:Q2444555"

The following pages link to A specialized branch \& bound \& cut for single-allocation ordered median hub location problems (Q2444555):

Displaying 13 items.

• Robust optimization approach to capacitated single and multiple allocation hub location problems (Q291363) (← links)
• Hub location under competition (Q322435) (← links)
• A comparative study of formulations and solution methods for the discrete ordered \(p\)-median problem (Q1652079) (← links)
• Incremental optimization of hub and spoke network for the spokes' numbers and flow (Q1666325) (← links)
• Perspectives on modeling hub location problems (Q2029941) (← links)
• A branch-and-price approach for the continuous multifacility monotone ordered median problem (Q2106721) (← links)
• The ordered \(k\)-median problem: surrogate models and approximation algorithms (Q2316614) (← links)
• Two-phase semi-Lagrangian relaxation for solving the uncapacitated distribution centers location problem for B2C E-commerce (Q2419538) (← links)
• A comparative study of different formulations for the capacitated discrete ordered median problem (Q2664433) (← links)
• Segmentation of scanning-transmission electron microscopy images using the ordered median problem (Q2672089) (← 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)
• Constraint relaxation for the discrete ordered median problem (Q6081610) (← links)