Lagrangean‐based solution approaches for the generalized problem of locating capacitated warehouses

DOI10.1111/j.1475-3995.2007.00616.xzbMath1135.90356OpenAlexW1973522191MaRDI QIDQ3502137

Tolga Bektaş, Akif Asil Bulgak

Publication date: 22 May 2008

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/j.1475-3995.2007.00616.x

zbMATH Keywords

decompositionsupply chainmulticommodity facility location

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Uses Software

• Knapsack

Cites Work

• Facility location models for distribution system design
• A branch-and-price algorithm for the capacitated facility location problem
• Meta-heuristic approaches with memory and evolution for a multi-product production/distribution system design problem
• An algorithm for solving large capacitated warehouse location problems
• Solving the staircase cost facility location problem with decomposition and piecewise linearization
• The capacitated plant location problem
• Upper and lower bounds for the single source capacitated location problem.
• A multiperiod two-echelon multicommodity capacitated plant location problem
• The volume algorithm: Producing primal solutions with a subgradient method
• Lagrangean heuristics for location problems
• Exact solution methods for uncapacitated location problems with convex transportation costs
• A simulated annealing methodology to distribution network design and management
• Lagrangean relaxation. (With comments and rejoinder).
• Efficient solution of large scale, single-source, capacitated plant location problems
• Heuristics for determining the number of warehouses for storing non-compatible products
• A Minimal Algorithm for the Bounded Knapsack Problem
• Validation of subgradient optimization