A Lagrangean heuristic for the facility location problem with staircase costs

DOI10.1016/S0377-2217(96)00058-6zbMath0923.90104WikidataQ128079022 ScholiaQ128079022MaRDI QIDQ1278582

Kaj Holmberg, Jonas Ling

Publication date: 22 February 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

subgradient optimizationcapacitated facility locationLagrangean heuristicheuristic solution methodsstaircase shaped production cost functions

Mathematics Subject Classification ID

Mixed integer programming (90C11) Discrete location and assignment (90B80)

Related Items

Capacitated refueling station location problem with traffic deviations over multiple time periods, A hybrid approach of bundle and Benders applied large mixed linear integer problem, Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities, Location of slaughterhouses under economies of scale, Supply chain design considering economies of scale and transport frequencies, Internet shopping with price sensitive discounts, Stochastic facility location with general long-run costs and convex short-run costs, Bounds for the single source modular capacitated plant location problem, A Lagrangean heuristic for the plant location problem with multiple facilities in the same site, On the capacitated concentrator location problem: a reformulation by discretization, A multi-stage facility location problem with staircase costs and splitting of commodities: model, heuristic approach and application, A fast exact method for the capacitated facility location problem with differentiable convex production costs, An effective logarithmic formulation for piecewise linearization requiring no inequality constraint, Modeling and solving a logging camp location problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A comparison of heuristics and relaxations for the capacitated plant location problem
• Heuristics for the capacitated plant location model
• ADD-heuristics' starting procedures for capacitated plant location models
• Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
• Solving the staircase cost facility location problem with decomposition and piecewise linearization
• Lagrangean heuristics for location problems
• Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-and-Bound
• Minimizing a sum of staircase functions under linear constraints
• A Dual-Based Procedure for Uncapacitated Facility Location
• A Lagrangian Heuristic for the Capacitated Plant Location Problem with Side Constraints
• Validation of subgradient optimization