Pages that link to "Item:Q3967331"

The following pages link to A Canonical Representation of Simple Plant Location Problems and Its Applications (Q3967331):

Displaying 19 items.

• Public service system design with fuzzy parameters of perceived utility (Q301934) (← links)
• Double bound method for solving the \(p\)-center location problem (Q336682) (← links)
• Complexity evaluation of benchmark instances for the \(p\)-median problem (Q636452) (← links)
• A flexible model and efficient solution strategies for discrete location problems (Q1028444) (← links)
• An improved Lagrangian relaxation and dual ascent approach to facility location problems (Q1789574) (← links)
• The simple plant location problem: Survey and synthesis (Q1837098) (← links)
• An analysis of the greedy algorithm for the submodular set covering problem (Q1838034) (← links)
• Design and analysis of hybrid metaheuristics for the reliability \(p\)-median problem (Q1926910) (← links)
• Alternative formulations for the obnoxious \(p\)-median problem (Q2217491) (← links)
• A tighter formulation of the \(p\)-median problem (Q2268764) (← links)
• Facility location with tree topology and radial distance constraints (Q2280295) (← links)
• A dual simplex algorithm for the canonical representation of the uncapacitated facility location problem (Q2314413) (← links)
• An aggressive reduction scheme for the simple plant location problem (Q2514768) (← links)
• Discrete facility location in machine learning (Q5100135) (← links)
• Robust MILP formulations for the two-stage weighted vertex \(p\)-center problem (Q6047873) (← links)
• Dynamically second-preferred \(p\)-center problem (Q6106963) (← links)
• An efficient Benders decomposition for the \(p\)-median problem (Q6167396) (← links)
• Formulations and valid inequalities for the capacitated dispersion problem (Q6179719) (← links)
• Connected graph partitioning with aggregated and non‐aggregated gap objective functions (Q6180037) (← links)