Pages that link to "Item:Q4146582"

The following pages link to The <i>m</i>-Center Problem: Minimax Facility Location (Q4146582):

Displaying 15 items.

• Double bound method for solving the \(p\)-center location problem (Q336682) (← links)
• A note on the m-center problem with rectilinear distances (Q913636) (← links)
• Locational analysis (Q1173002) (← links)
• An algorithm for the bottleneck generalized assignment problem (Q1260736) (← links)
• The stochastic bottleneck linear programming problem (Q1304778) (← links)
• A surrogate heuristic for set covering problems (Q1342046) (← links)
• Heuristic methods and applications: A categorized survey (Q1823879) (← links)
• The stratified \(p\)-center problem (Q2003436) (← links)
• Minimax models for capacitated \(p\)-center problem in uncertain environment (Q2052930) (← links)
• A scaleable projection-based branch-and-cut algorithm for the \(p\)-center problem (Q2673558) (← links)
• Bottleneck linear programming (Q4117598) (← links)
• The Variance Location Problem on a Network with Continuously distributed demand (Q4497891) (← links)
• (Q5054582) (← links)
• Discrete Center Problems (Q5506720) (← links)
• Exact solution approaches for the discrete <i>α</i>‐neighbor <i>p</i>‐center problem (Q6180026) (← links)