Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem

DOI10.1007/S10479-012-1221-3MaRDI QIDQ490197zbMATHOpenAlexFDO

Authors Yong-Cai Geng, Sumit K. Garg

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

zbMATH Keywords

transportationbranch and bounddiscrete approximationfacility location-allocation

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Mixed integer programming (90C11) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Discrete location and assignment (90B80)

Recommendations

• New heuristic methods for the capacitated multi-facility Weber problem
• Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem
• Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems
• Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem
• A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations

Cites work

• scientific article; zbMATH DE number 417962 (Why is no real title available?)
• scientific article; zbMATH DE number 5282971 (Why is no real title available?)
• scientific article; zbMATH DE number 3176962 (Why is no real title available?)
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 1253061 (Why is no real title available?)
• A general global optimization approach for solving location problems in the plane
• A guided reactive GRASP for the capacitated multi-source Weber problem
• A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem
• A perturbation-based heuristic for the capacitated multisource Weber problem
• A reformulation-linearization technique for solving discrete and continuous nonconvex problems
• A squared-euclidean distance location-allocation problem
• Accelerating convergence in the Fermat-Weber location problem
• Approximation of solutions for location problems
• Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem
• Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem
• GBSSS: The generalized big square small square method for planar single- facility location
• Global Convergence of a Generalized Iterative Procedure for the Minisum Location Problem with lp Distances
• Global Optimization Procedures for the Capacitated Euclidean and l_p Distance Multifacility Location-Allocation Problems
• Integer Programming by Implicit Enumeration and Balas’ Method
• Location Theory, Dominance, and Convexity
• Location with acceleration-deceleration distance
• NP-Hard, Capacitated, Balanced p-Median Problems on a Chain Graph with a Continuum of Link Demands
• New heuristic methods for the capacitated multi-facility Weber problem
• On the point for which the sum of the distances to \(n\) given points is minimum
• Region-rejection based heuristics for the capacitated multi-source Weber problem
• Some Properties of Location Problems with Block and Round Norms
• Technical Note—Location Theory, Dominance, and Convexity: Some Further Results
• The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
• The Transportation-Location Problem
• The gradual covering problem
• Using Block Norms for Location Modeling
• Validation of subgradient optimization

Cited in

(25)

• A continuation approach for the capacitated multi-facility weber problem based on nonlinear SOCP reformulation
• A branch-and-price algorithm for the multi-source Weber problem
• Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem
• Region-rejection based heuristics for the capacitated multi-source Weber problem
• A generalized Weiszfeld method for the multi-facility location problem
• 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
• A location-allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locations
• A convergent approximation scheme for efficient sets of the multi-criteria Weber location problem
• Discrete approximation heuristics for the capacitated continuous location-allocation problem with probabilistic customer locations
• The continuous single-source capacitated multi-facility Weber problem with setup costs: formulation and solution methods
• A guided reactive GRASP for the capacitated multi-source Weber problem
• New heuristic methods for the capacitated multi-facility Weber problem
• Hybrid cell selection-based heuristic for capacitated multi-facility weber problem with continuous fixed costs
• Global Optimization Procedures for the Capacitated Euclidean and l_p Distance Multifacility Location-Allocation Problems
• Global optimization algorithm for capacitated multi-facility continuous location-allocation problems
• scientific article; zbMATH DE number 5282971 (Why is no real title available?)
• The multi-facility min-max Weber problem
• Multi-facility green Weber problem
• Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems
• Solving the uncapacitated multi-facility Weber problem by vector quantization and self-organizing maps
• On the Weber facility location problem with limited distances and side constraints
• Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm
• The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem
• Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem

This page was built for publication: Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q490197)