A branch‐bound algorithm for the capacitated facilities location problem
From MaRDI portal
Cites work
Cited in
(43)- A branch and bound algorithm for the partial coverage capacitated plant location problem
- Heuristics for the capacitated plant location model
- A partial dual algorithm for the capacitated warehouse location problem
- A cost operator approach to multistage location-allocation
- Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
- An exact algorithm for the concave transportation problem
- The capacitated distribution and waste disposal problem
- Solving the plant location problem on a line by linear programming
- Application of facility location modeling constructs to vendor selection problems
- The capacitated plant location problem
- The design of reverse distribution networks: Models and solution procedures
- Optimal long-term distributed generation planning and reconfiguration of distribution systems: an accelerating Benders' decomposition approach
- The simple plant location problem: Survey and synthesis
- Facility location with increasing production costs
- 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
- Integrating operations and marketing decisions using delayed differentiation of products and guaranteed delivery time under stochastic demand
- A heuristic preprocessor supported algorithm for the capacitated plant location problem
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms
- Automatic tracking and positioning algorithm for moving targets in complex environment
- A cross decomposition algorithm for a multiproduct-multitype facility location problem
- Integrated forward/reverse logistics network design under uncertainty with pricing for collection of used products
- Optimizing two-level reverse distribution networks with hybrid memetic algorithms
- Locating repair shops in a stochastic environment
- A memetic algorithm for bi-objective integrated forward/reverse logistics network design
- A direct dual method for the mixed plant location problem with some side constraints
- Variable neighborhood search for the bi-objective post-sales network design problem: a fitness landscape analysis approach
- Networks synthesis and optimum network design problems: Models, solution methods and applications
- Designing satellite communication networks by zero—one quadratic programming
- LARGE SCALE NETWORK ARCHITECTURE SYNTHESIS: INTERACTIVE STRATEGY
- Modelle und Verfahren zur Bestimmung betrieblicher und innerbetrieblicher Standorte — Ein Überblick
- Location of concentrators in a computer communication network: a stochastic automation search method
- Discrete equal-capacityp-median problem
- scientific article; zbMATH DE number 4197716 (Why is no real title available?)
- Reverse logistics network design: a water flow-like algorithm approach
- A graph theoretic-based heuristic algorithm for responsive supply chain network design with direct and indirect shipment
- Capacitated facility location/network design problems.
- A generalized model for locating facilities on a network with flow-based demand
- Fifty years of location theory -- a selective review
- A branch-and-bound algorithm for the multi-level uncapacitated facility 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
- Approximate solutions to large scale capacitated facility location problems
This page was built for publication: A branch‐bound algorithm for the capacitated facilities location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5580097)
