A squared-euclidean distance location-allocation problem

DOI<447::AID-NAV3220390403>3.0.CO;2-O 10.1002/1520-6750(199206)39:4<447::AID-NAV3220390403>3.0.CO;2-OzbMath0763.90061OpenAlexW2057560830MaRDI QIDQ4005859

Cihan H. Tuncbilek, Hanif D. Sherali

Publication date: 27 September 1992

Full work available at URL: https://doi.org/10.1002/1520-6750(199206)39:4<447::aid-nav3220390403>3.0.co;2-o

zbMATH Keywords

Lagrangian relaxationbranch-and-boundsquared-Euclidean distance location-allocationbalanced transportation constraints

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Continuous location (90B85) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (15)

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

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: A squared-euclidean distance location-allocation problem