Pages that link to "Item:Q4005859"

The following pages link to A squared-euclidean distance location-allocation problem (Q4005859):

Displaying 15 items.

• Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems (Q336701) (← links)
• A new heuristic for solving the \(p\)-median problem in the plane (Q339602) (← links)
• Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem (Q490197) (← links)
• A guided reactive GRASP for the capacitated multi-source Weber problem (Q622155) (← links)
• A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem (Q1327241) (← links)
• A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems (Q1329799) (← links)
• Location and layout planning. A survey (Q1372765) (← links)
• Global optimization algorithm for capacitated multi-facility continuous location-allocation problems (Q1668802) (← links)
• The continuous single source location problem with capacity and zone-dependent fixed cost: models and solution approaches (Q1695018) (← links)
• Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem (Q1761969) (← links)
• Classical and inverse median location problems under uncertain environment (Q1987593) (← links)
• Heuristic approaches for solid transportation-\(p\)-facility location problem (Q2201302) (← links)
• An exact and a heuristic approach for the transportation-\(p\)-facility location problem (Q2221475) (← links)
• Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs (Q2564623) (← links)
• Mean-variance value at risk criterion for solving a \(p\)-median location problem on networks with type-2 intuitionistic fuzzy weights (Q6049306) (← links)