An Efficient Branch and Bound Algorithm for the Warehouse Location Problem
From MaRDI portal
Cited in
(54)- Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems
- A cross decomposition algorithm for a multiproduct-multitype facility location problem
- Modelle und Verfahren zur Bestimmung betrieblicher und innerbetrieblicher Standorte — Ein Überblick
- A search tree algorithm for plant location problems
- An algorithm for solving the multi-period online fulfillment assignment problem
- Capacitated facility location problem with general setup cost
- Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité
- Facility location models for distribution system design
- Fifty years of location theory -- a selective review
- A neural model for the p-median problem
- Integral analysis method - IAM
- A tree search algorithm for the p-median problem
- Application of facilities location to an insurance company’s office reconfiguration
- Optimal and heuristic algorithms for multiproduct uncapacitated facility location
- On the coordination of product and by-product flows in two-level distribution networks: Model formulations and solution procedures
- Branch and bound algorithm for the warehouse location problem with the objective function as linear fractional
- Nonconvex optimization over a polytope using generalized capacity improvement
- An algorithm for a concave production cost network flow problem
- Uncapacitated and capacitated facility location problems
- A multi-stage facility location problem with staircase costs and splitting of commodities: model, heuristic approach and application
- Agile optimization for a real‐time facility location problem in Internet of Vehicles networks
- Uncapacitated facility location: General solution procedure and computational experience
- A branch and bound algorithm for the partial coverage capacitated plant location problem
- A branch and bound algorithm for the two-level uncapacitated facility location problem with some side constraints
- A branch-and-bound algorithm for the multi-level uncapacitated facility location problem
- A bibliography for some fundamental problem categories in discrete location science
- Location of concentrators in a computer communication network: a stochastic automation search method
- Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds
- An integrated evaluation of facility location, capacity aquisition, and technology selection for designing global manufacturing strategies
- A decomposition approach to solve a bilevel capacitated facility location problem with equity constraints
- A robustness approach to international sourcing
- Efficient preprocessing methods for tabu search: an application on asymmetric travelling salesman problem
- An algorithm for the capacitated, multi-commodity multi-period facility location problem.
- Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type
- A simple plant-location model for quantity-setting firms subject to price uncertainty
- A direct dual method for the mixed plant location problem with some side constraints
- Facility location models for distribution planning
- An optimal algorithm for the multiproduct capacitated facility location problem with a choice of facility type
- Simple plant location under uniform delivered pricing
- Locational analysis
- Methods for a class of discrete location problems
- The simple plant location problem: Survey and synthesis
- A comparison of two dual-based procedures for solving the p-median problem
- Data aggregation for \(p\)-median problems
- Network production-location problems under price uncertainty
- A tree search algorithm for the multi-commodity location problem
- The dynamic relocation and phase-out of a hybrid two-echelon plant/warehousing facility: A multiple objective approach
- Facility location with increasing production costs
- ASEAN industrial cooperation: The case of multi-product capacity expansion
- An improved Lagrangian relaxation and dual ascent approach to facility location problems
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms
- Redesigning a warehouse network
- A branch-and-bound method for multicommodity location with balancing requirements
- Dynamic-demand capacitated facility location problems with and without relocation
This page was built for publication: An Efficient Branch and Bound Algorithm for the Warehouse Location Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5650514)
