A branch‐bound algorithm for the capacitated facilities location problem
From MaRDI portal
Publication:5580097
DOI10.1002/nav.3800160306zbMath0186.24905OpenAlexW1799397840MaRDI QIDQ5580097
Publication date: 1969
Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.3800160306
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)
Related Items
LARGE SCALE NETWORK ARCHITECTURE SYNTHESIS: INTERACTIVE STRATEGY, Application of facility location modeling constructs to vendor selection problems, A cross decomposition algorithm for a multiproduct-multitype facility location problem, Unnamed Item, Variable neighborhood search for the bi-objective post-sales network design problem: a fitness landscape analysis approach, Integrated forward/reverse logistics network design under uncertainty with pricing for collection of used products, A memetic algorithm for bi-objective integrated forward/reverse logistics network design, Robust-fuzzy optimization approach in design of sustainable lean supply chain network under uncertainty, E-platooning: optimizing platoon formation for long-haul transportation with electric commercial vehicles, A direct dual method for the mixed plant location problem with some side constraints, Discrete equal-capacityp-median problem, A generalized model for locating facilities on a network with flow-based demand, The capacitated plant location problem, The design of reverse distribution networks: Models and solution procedures, A cost operator approach to multistage location-allocation, Approximate solutions to large scale capacitated facility location problems, Modelle und Verfahren zur Bestimmung betrieblicher und innerbetrieblicher Standorte — Ein Überblick, Optimizing two-level reverse distribution networks with hybrid memetic algorithms, Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem, Optimal long-term distributed generation planning and reconfiguration of distribution systems: an accelerating Benders' decomposition approach, Networks synthesis and optimum network design problems: Models, solution methods and applications, Designing satellite communication networks by zero—one quadratic programming, Reverse logistics network design: a water flow-like algorithm approach, Capacitated facility location/network design problems., Integrating operations and marketing decisions using delayed differentiation of products and guaranteed delivery time under stochastic demand, Location of concentrators in a computer communication network: a stochastic automation search method, A graph theoretic-based heuristic algorithm for responsive supply chain network design with direct and indirect shipment, An exact algorithm for the concave transportation problem, A heuristic preprocessor supported algorithm for the capacitated plant location problem, Minimum concave-cost network flow problems: Applications, complexity, and algorithms, The capacitated distribution and waste disposal problem, A branch and bound algorithm for the partial coverage capacitated plant location problem, Solving the plant location problem on a line by linear programming, Automatic tracking and positioning algorithm for moving targets in complex environment, The simple plant location problem: Survey and synthesis, Heuristics for the capacitated plant location model, A branch-and-bound algorithm for the multi-level uncapacitated facility location problem, Locating repair shops in a stochastic environment, A partial dual algorithm for the capacitated warehouse location problem, 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
Cites Work
