An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem

DOI10.1287/mnsc.23.6.585zbMath0348.90157OpenAlexW1979519690MaRDI QIDQ4119045

Umit Akinc, Basheer M. Khumawala

Publication date: 1977

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.23.6.585

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Integer programming (90C10)

Related Items

Optimal and heuristic algorithms for multiproduct uncapacitated facility location, A cyclic allocation model for the inventory-modulated capacitated location problem, Uncapacitated facility location: General solution procedure and computational experience, A cross decomposition algorithm for a multiproduct-multitype facility location problem, Application of the facility location problem to the problem of locating concentrators on an FAA microwave system, Efficient algorithms for the capacitated concentrator location problem, A decomposition approach to solve a bilevel capacitated facility location problem with equity constraints, On an extension of Weber problem with Euclidean distance, An algorithm for solving large capacitated warehouse location problems, Developing new formulations and relaxations of single stage capacitated warehouse location problem (SSCWLP): empirical investigation for assessing relative strengths and computational effort, Vehicle routing considerations in distribution system design, A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points, Unnamed Item, Complements and substitutes among locations in the two-stage transshipment problem, Production planning and warehouse management in supply networks with inter-facility mold transfers, The capacitated plant location problem, Locating Satellite Yards in Forestry Operations, A cost operator approach to multistage location-allocation, A search tree algorithm for plant location problems, Application of facilities location to an insurance company’s office reconfiguration, Approximate solutions to large scale capacitated facility location problems, Minimizing a sum of staircase functions under linear constraints, Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem, Locational analysis, Solving the facility location and fixed charge solid transportation problem, An integrated evaluation of facility location, capacity aquisition, and technology selection for designing global manufacturing strategies, Capacitated facility location/network design problems., An algorithm for the capacitated, multi-commodity multi-period facility location problem., Capacitated facility location problem with general setup cost, A heuristic preprocessor supported algorithm for the capacitated plant location problem, Minimum concave-cost network flow problems: Applications, complexity, and algorithms, Optimization of resource location in hierarchical computer networks, Planning capacity and safety stocks in a serial production-distribution system with multiple products, Integrated production/distribution planning in supply chains: An invited review, Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type, A branch and bound algorithm for the partial coverage capacitated plant location problem, Lower and upper bounds for a capacitated plant location problem with multicommodity flow, The return plant location problem: Modelling and resolution, The simple plant location problem: Survey and synthesis, A continuous model for production-distribution system design, A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem, Heuristics for the capacitated plant location model, Uncapacitated and Capacitated Facility Location Problems, An algorithm for a concave production cost network flow problem, A branch-and-bound algorithm for the multi-level uncapacitated facility location problem, A multiplier adjustment technique for the capacitated concentrator location problem, The capacitated facility location problem with random input data, 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 comparison of heuristics and relaxations for the capacitated plant location problem, An optimal algorithm for the multiproduct capacitated facility location problem with a choice of facility type, Facility location with increasing production costs, The pure fixed charge transportation problem