Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem
From MaRDI portal
Publication:490197
DOI10.1007/s10479-012-1221-3zbMath1303.90064OpenAlexW2028634810MaRDI QIDQ490197
Publication date: 22 January 2015
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-012-1221-3
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Discrete location and assignment (90B80)
Related Items (4)
The continuous single source location problem with capacity and zone-dependent fixed cost: models and solution approaches ⋮ Solving a minisum single facility location problem in three regions with different norms ⋮ The continuous single-source capacitated multi-facility Weber problem with setup costs: formulation and solution methods ⋮ The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A guided reactive GRASP for the capacitated multi-source Weber problem
- A perturbation-based heuristic for the capacitated multisource Weber problem
- A general global optimization approach for solving location problems in the plane
- Region-rejection based heuristics for the capacitated multi-source Weber problem
- On the point for which the sum of the distances to \(n\) given points is minimum
- Location with acceleration-deceleration distance
- GBSSS: The generalized big square small square method for planar single- facility location
- Accelerating convergence in the Fermat-Weber location problem
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem
- Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem
- Approximation of solutions for location problems
- The gradual covering problem
- Some Properties of Location Problems with Block and Round Norms
- New heuristic methods for the capacitated multi-facility Weber problem
- Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem
- Global Optimization Procedures for the Capacitated Euclidean and lp Distance Multifacility Location-Allocation Problems
- The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
- Using Block Norms for Location Modeling
- NP-Hard, Capacitated, Balanced p-Median Problems on a Chain Graph with a Continuum of Link Demands
- Technical Note—Location Theory, Dominance, and Convexity: Some Further Results
- A squared-euclidean distance location-allocation problem
- Global Convergence of a Generalized Iterative Procedure for the Minisum Location Problem with lp Distances
- Validation of subgradient optimization
- Integer Programming by Implicit Enumeration and Balas’ Method
- The Transportation-Location Problem
- Location Theory, Dominance, and Convexity
This page was built for publication: Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem
