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