Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem
From MaRDI portal
Publication:1761969
DOI10.1016/j.cor.2011.03.015zbMath1251.90233OpenAlexW1994561740MaRDI QIDQ1761969
Publication date: 15 November 2012
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2011.03.015
Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (5)
On statistical bounds of heuristic solutions to location problems ⋮ Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems ⋮ Solving a minisum single facility location problem in three regions with different norms ⋮ Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem ⋮ Confidence in heuristic solutions?
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Region-rejection based heuristics for the capacitated multi-source Weber problem
- Parametric distance functions vs. nonparametric neural networks for estimating road travel distances
- Heuristic solution of the multisource Weber problem as a \(p\)-median problem
- 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
- A cellular heuristic for the multisource Weber problem.
- Case study on statistically estimating minimum makespan for flow line scheduling problems.
- Approximation of solutions for location problems
- Fast, efficient and accurate solutions to the Hamiltonian path problem using neural approaches
- 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
- Using Block Norms for Location Modeling
- Using Confidence Limits for the Global Optimum in Combinatorial Optimization
- NP-Hard, Capacitated, Balanced p-Median Problems on a Chain Graph with a Continuum of Link Demands
- Technical Note—A New Norm for Measuring Distance Which Yields Linear Location Problems
- Technical Note—Location Theory, Dominance, and Convexity: Some Further Results
- A squared-euclidean distance location-allocation problem
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- Interval estimation of a global optimum for large combinatorial problems
- Point estimation of a global optimum for large combinatorial problems
- A statistical approach to the tsp
- Global Convergence of a Generalized Iterative Procedure for the Minisum Location Problem with lp Distances
- Heuristic Methods for Location-Allocation Problems
- Validation of subgradient optimization
- The Transportation-Location Problem
- Location Theory, Dominance, and Convexity
This page was built for publication: Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem
