Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems
From MaRDI portal
(Redirected from Publication:336701)
Recommendations
- Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem
- New heuristic methods for the capacitated multi-facility Weber problem
- Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem
- Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem
- scientific article; zbMATH DE number 5282971
Cites work
- scientific article; zbMATH DE number 5282971 (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 localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem
- A perturbation-based heuristic for the capacitated multisource Weber problem
- A recovering beam search algorithm for the single machine just-in-time scheduling problem
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- A squared-euclidean distance location-allocation problem
- Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups
- 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 lp Distance Multifacility Location-Allocation Problems
- Heuristic Methods for Location-Allocation Problems
- Heuristic solution of the multisource Weber problem as a \(p\)-median problem
- Location Theory, Dominance, and Convexity
- Location with acceleration-deceleration distance
- Location-Allocation Problems
- 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 Set of Optimal Points to the Weber Problem: Further Results
- Parametric distance functions vs. nonparametric neural networks for estimating road travel distances
- Recovering beam search: Enhancing the beam search approach for combinatorial optimization problems
- 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 Minisum and Minimax Location Problems Revisited
- The Single Machine Early/Tardy Problem
- The Transportation-Location Problem
- The gradual covering problem
Cited in
(6)- Efficient heuristics for the rectilinear distance capacitated multi-facility Weber problem
- Optimal number and location of storage hubs and biogas production reactors in farmlands with allocation of multiple feedstocks
- Application of heuristic and metaheuristic algorithms in solving constrained Weber problem with feasible region bounded by arcs
- Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem
- Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm
- Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem
This page was built for publication: Beam search heuristics for the single and multi-commodity capacitated multi-facility Weber problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336701)
