Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type
From MaRDI portal
Recommendations
- Optimal and heuristic algorithms for multiproduct uncapacitated facility location
- An effective heuristic for large-scale capacitated facility location problems
- A simple but usually fast branch-and-bound algorithm for the capacitated facility location problem
- A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
- A Dual-Based Algorithm for Multiproduct Uncapacitated Facility Location
Cites work
- A cross decomposition algorithm for a multiproduct-multitype facility location problem
- A Cross Decomposition Algorithm for Capacitated Facility Location
- A Dual-Based Algorithm for Multiproduct Uncapacitated Facility Location
- A Dual-Based Procedure for Uncapacitated Facility Location
- A heuristic lagrangean algorithm for the capacitated plant location problem
- A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times
- A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
- A new Lagrangian relaxation approach to the generalized assignment problem
- An Additive Algorithm for Solving Linear Programs with Zero-One Variables
- An Algorithm for the Fixed-Charge Assigning Users to Sources Problem
- An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem
- An Efficient Branch and Bound Algorithm for the Warehouse Location Problem
- An optimal algorithm for the multiproduct capacitated facility location problem with a choice of facility type
- Cross decomposition for mixed integer programming
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems
- Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing
- Multicommodity Distribution System Design by Benders Decomposition
- Multiple-facility loading under capacity-based economies of scope
- On convergence rates of subgradient optimization methods
- Resource-Constrained Assignment Scheduling
- The capacitated plant location problem
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- The simple plant location problem: Survey and synthesis
- Validation of subgradient optimization
Cited in
(28)- A genetic algorithm for a single product network design model with lead time and safety stock considerations
- Simultaneous siting and sizing of distribution centers on a plane
- Facility location and supply chain management. A review
- Optimal and heuristic algorithms for multiproduct uncapacitated facility location
- Product allocation to different types of distribution center in retail logistics networks
- A hierarchical solution approach for a multicommodity distribution problem under a special cost structure
- Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers
- Integrated production/distribution planning in supply chains: An invited review
- The capacitated plant location problem with multiple facilities in the same site
- A Benders decomposition approach for a real case supply chain network design with capacity acquisition and transporter planning: wheat distribution network
- Integrated design and operation of remnant inventory supply chains under uncertainty
- A cross decomposition algorithm for a multiproduct-multitype facility location problem
- A \(k\)-product uncapacitated facility location problem
- Capacitated facility location problem with general setup cost
- A simple but usually fast branch-and-bound algorithm for the capacitated facility location problem
- A new mixed integer programming model for curriculum balancing: application to a Turkish university
- Linear relaxation solution based heuristics for a class of multi-product facility location problems
- A tabu search algorithm for application placement in computer clustering
- Solution method for the location planning problem of logistics park with variable capacity
- Application placement and backup service in computer clustering in software as a service (SaaS) networks
- Incorporating cellular manufacturing into supply chain design
- Price negotiation for capacity sharing in a two-factory environment using genetic algorithm
- A Facility Location Problem With Aggregate Capacity
- Multiple-facility loading under capacity-based economies of scope
- Approximation algorithm for the k-product uncapacitated facility location problem with penalties
- Facility location models for distribution system design
- On efficient matheuristic algorithms for multi-period stochastic facility location-assignment problems
- An optimal algorithm for the multiproduct capacitated facility location problem with a choice of facility type
This page was built for publication: Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1809805)
