An algorithm for solving large capacitated warehouse location problems
From MaRDI portal
Publication:1099067
DOI10.1016/0377-2217(88)90175-0zbMath0637.90033OpenAlexW2017330843MaRDI QIDQ1099067
Publication date: 1988
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(88)90175-0
Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Inventory, storage, reservoirs (90B05)
Related Items
Optimal Physician assignment and patient demand allocation in an outpatient care network, A branch-and-price algorithm for the capacitated facility location problem, Unnamed Item, Location and layout planning. A survey, Lagrangean‐based solution approaches for the generalized problem of locating capacitated warehouses, Designing e‐commerce supply chains: a stochastic facility–location approach, The capacitated plant location problem with multiple facilities in the same site, Mixed logical-linear programming, RAMP algorithms for the capacitated facility location problem, Enhancing an algorithm for set covering problems, An integrated evaluation of facility location, capacity aquisition, and technology selection for designing global manufacturing strategies, Fast bounding procedures for large instances of the simple plant location problem, Bounds for the single source modular capacitated plant location problem, A capacitated facility location problem with constrained backlogging probabilities, Facility location models for distribution system design, A Lagrangean heuristic for the plant location problem with multiple facilities in the same site, Capacitated facility location problem with general setup cost, A new extended formulation with valid inequalities for the capacitated concentrator location problem, A new method for solving capacitated location problems based on a set partitioning approach, Lagrangean heuristics for location problems, An exact method for the two-echelon, single-source, capacitated facility location problem, Combining leximax fairness and efficiency in a mathematical programming model, Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem, An effective heuristic for large-scale capacitated facility location problems, Planning models for long-haul operations of postal and express shipment companies, Uncapacitated and Capacitated Facility Location Problems, Robustness of solutions to the capacitated facility location problem with uncertain demand, Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing, Facility location with increasing production costs, Metaheuristic applications on discrete facility location problems: a survey
Cites Work
- Unnamed Item
- A heuristic lagrangean algorithm for the capacitated plant location problem
- Heuristics for the capacitated plant location model
- A partial dual algorithm for the capacitated warehouse location problem
- ADD-heuristics' starting procedures for capacitated plant location models
- Facility location models for distribution planning
- A search tree algorithm for plant location problems
- Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
- On the use of tree indexing methods in transportation algorithms
- Kapazitätsplanung in Netzwerken. Ein Überblick über neuere Modelle und Verfahren. (Resource-constrained project planning in networks. A survey on new models and methods)
- Some Add-Drop and Drop-Add Interchange Heuristics for Non-Linear Warehouse Location
- Solving large-scale mixed-integer programs with fixed charge variables
- A Cross Decomposition Algorithm for Capacitated Facility Location
- Inverse Optimization: An Application to the Capacitated Plant Location Problem
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Linear Relaxations of the Capacitated Warehouse Location Problem
- An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem
- Modeling Facility Location Problems as Generalized Assignment Problems
