Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
From MaRDI portal
Publication:1171987
DOI10.1016/0377-2217(83)90179-0zbMath0499.90027OpenAlexW2003633968MaRDI QIDQ1171987
Nicos Christofides, John E. Beasley
Publication date: 1983
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(83)90179-0
Lagrangean relaxationlower boundsubgradient optimisationmixed-integer formulationcapacitated warehouse location problemproblem reduction teststree search procedure
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Mixed integer programming (90C11) Continuous location (90B85)
Related Items
Capacitated refueling station location problem with traffic deviations over multiple time periods, A cross decomposition algorithm for a multiproduct-multitype facility location problem, A heuristic for large-size \(p\)-median location problems with application to school location, An algorithm for solving large capacitated warehouse location problems, Developing new formulations and relaxations of single stage capacitated warehouse location problem (SSCWLP): empirical investigation for assessing relative strengths and computational effort, Vehicle routing considerations in distribution system design, Dynamic bundle methods, A branch-and-price algorithm for the capacitated facility location problem, Location and layout planning. A survey, Solving the anti-covering location problem using Lagrangian relaxation, A model for the capacitated \(p\)-facility location problem in global environments, The capacitated plant location problem, The capacitated plant location problem with multiple facilities in the same site, Approximate solutions to large scale capacitated facility location problems, The \(K\)-coverage concentrator location problem, Experiments with primal - dual decomposition and subgradient methods for the uncapacitatied facility location problem, Capacitated facility location/network design problems., Facility location models for distribution system design, A Lagrangean heuristic for the plant location problem with multiple facilities in the same site, Capacitated facility location problem with general setup cost, A heuristic preprocessor supported algorithm for the capacitated plant location problem, A new method for solving capacitated location problems based on a set partitioning approach, Lagrangean heuristics for location problems, Valid inequalities and facets of the capacitated plant location problem, The capacitated distribution and waste disposal problem, A branch and bound algorithm for the partial coverage capacitated plant location problem, A computational evaluation of a general branch-and-price framework for capacitated network location problems, A Lagrangean heuristic for the facility location problem with staircase costs, An exact method for the two-echelon, single-source, capacitated facility location problem, A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem, Heuristics for the capacitated plant location model, Locating repair shops in a stochastic environment, A partial dual algorithm for the capacitated warehouse location problem, ADD-heuristics' starting procedures for capacitated plant location models, Computational results from a new Lagrangean relaxation algorithm for the capacitated plant 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, Modelling a fertiliser distribution system, Facility location with increasing production costs
Uses Software
Cites Work
- Unnamed Item
- A tree search algorithm for the p-median problem
- A direct dual method for the mixed plant location problem with some side constraints
- A Cross Decomposition Algorithm for Capacitated Facility Location
- A Dual-Based Procedure for Uncapacitated Facility Location
- An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem
- Modeling Facility Location Problems as Generalized Assignment Problems
- A Branch and Bound Algorithm for the p-Median Transportation Problem
- An Improved Algorithm for the Capacitated Facility Location Problem
- Cross decomposition for mixed integer programming
- Validation of subgradient optimization
- A branch‐bound algorithm for the capacitated facilities location problem
