Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type
From MaRDI portal
Publication:1809805
DOI10.1016/S0377-2217(98)00303-8zbMath0938.90049OpenAlexW1989108234MaRDI QIDQ1809805
Alan W. Neebe, Joseph B. Mazzola
Publication date: 27 June 2000
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(98)00303-8
branch-and-bound algorithminteger programmingLagrangian relaxationheuristiccapacitated facility location
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)
Related Items
A new mixed integer programming model for curriculum balancing: application to a Turkish university, 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, Product allocation to different types of distribution center in retail logistics networks, A Benders decomposition approach for a real case supply chain network design with capacity acquisition and transporter planning: wheat distribution network, Incorporating cellular manufacturing into supply chain design, Price negotiation for capacity sharing in a two-factory environment using genetic algorithm, A \(k\)-product uncapacitated facility location problem, A hierarchical solution approach for a multicommodity distribution problem under a special cost structure, Facility location models for distribution system design, Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers, Integrated design and operation of remnant inventory supply chains under uncertainty, A genetic algorithm for a single product network design model with lead time and safety stock considerations, Integrated production/distribution planning in supply chains: An invited review, Simultaneous siting and sizing of distribution centers on a plane, Facility location and supply chain management. A review
Cites Work
- Unnamed Item
- Unnamed Item
- Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing
- A heuristic lagrangean algorithm for the capacitated plant location problem
- An optimal algorithm for the multiproduct capacitated facility location problem with a choice of facility type
- A new Lagrangian relaxation approach to the generalized assignment problem
- The capacitated plant location problem
- The simple plant location problem: Survey and synthesis
- A cross decomposition algorithm for a multiproduct-multitype facility location problem
- Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems
- A Dual-Based Algorithm for Multiproduct Uncapacitated Facility Location
- An Algorithm for the Fixed-Charge Assigning Users to Sources Problem
- A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
- A Cross Decomposition Algorithm for Capacitated Facility Location
- Resource-Constrained Assignment Scheduling
- A Dual-Based Procedure for Uncapacitated Facility Location
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Multicommodity Distribution System Design by Benders Decomposition
- An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- On convergence rates of subgradient optimization methods
- A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times
- Multiple-facility loading under capacity-based economies of scope
- Cross decomposition for mixed integer programming
- Validation of subgradient optimization
- An Additive Algorithm for Solving Linear Programs with Zero-One Variables
- An Efficient Branch and Bound Algorithm for the Warehouse Location Problem
