Pages that link to "Item:Q2379187"

The following pages link to An extended covering model for flexible discrete and equity location problems (Q2379187):

Displaying 23 items.

• Inequity averse optimization in operational research (Q319581) (← links)
• When centers can fail: a close second opportunity (Q337641) (← links)
• A parallelized lagrangean relaxation approach for the discrete ordered median problem (Q512991) (← links)
• Balancing the arrival times of users in a two-stage location problem (Q512992) (← links)
• On relaxing the integrality of the allocation variables of the reliability fixed-charge location problem (Q522273) (← links)
• The discrete facility location problem with balanced allocation of customers (Q631097) (← links)
• Equity models in planar location (Q871686) (← links)
• A flexible model and efficient solution strategies for discrete location problems (Q1028444) (← links)
• A revised variable neighborhood search for the discrete ordered median problem (Q1634286) (← links)
• A comparative study of formulations and solution methods for the discrete ordered \(p\)-median problem (Q1652079) (← links)
• Optimization problems with flexible objectives: a general modeling approach and applications (Q1698885) (← links)
• A branch-and-price approach for the continuous multifacility monotone ordered median problem (Q2106721) (← links)
• A fresh view on the discrete ordered median problem based on partial monotonicity (Q2189878) (← links)
• Fair resource allocation: using welfare-based dominance constraints (Q2242256) (← links)
• A modified variable neighborhood search for the discrete ordered median problem (Q2256171) (← links)
• Lexicographical order in integer programming (Q2405486) (← links)
• Ordered \(p\)-median problems with neighbourhoods (Q2419559) (← links)
• A specialized branch \& bound \& cut for single-allocation ordered median hub location problems (Q2444555) (← links)
• Solving the \(p\)-median problem on regular and lattice networks (Q2664388) (← 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)
• Constraint relaxation for the discrete ordered median problem (Q6081610) (← links)
• Dynamically second-preferred \(p\)-center problem (Q6106963) (← links)