A Cross Decomposition Algorithm for Capacitated Facility Location
From MaRDI portal
Publication:3725832
DOI10.1287/OPRE.34.1.145zbMath0594.90022OpenAlexW2149913958MaRDI QIDQ3725832
Publication date: 1986
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.34.1.145
Lagrangean relaxationcomputational resultscapacitated facility locationdual ascent methodplant locationcross decomposition methodadjustment proceduredual subproblemprimal subproblem
Numerical mathematical programming methods (65K05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Inventory, storage, reservoirs (90B05)
Related Items (74)
On using approximations of the Benders master problem ⋮ Solving the staircase cost facility location problem with decomposition and piecewise linearization ⋮ A Lagrangian heuristic for the capacitated plant location problem with single source constraints ⋮ A cross decomposition algorithm for a multiproduct-multitype facility location problem ⋮ Multi-item capacitated lot-sizing by a cross decomposition based algorithm ⋮ An algorithm for solving large capacitated warehouse location problems ⋮ Benders decomposition without separability: a computational study for capacitated facility location problems ⋮ Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems ⋮ Developing new formulations and relaxations of single stage capacitated warehouse location problem (SSCWLP): empirical investigation for assessing relative strengths and computational effort ⋮ A robust optimisation model and cutting planes for the planning of energy-efficient wireless networks ⋮ Solving a dynamic facility location problem with partial closing and reopening ⋮ Optimal Physician assignment and patient demand allocation in an outpatient care network ⋮ A branch-and-price algorithm for the capacitated facility location problem ⋮ A perturbation-based heuristic for the capacitated multisource Weber problem ⋮ Unnamed Item ⋮ Location and layout planning. A survey ⋮ A model for the capacitated \(p\)-facility location problem in global environments ⋮ A hybrid approach of bundle and Benders applied large mixed linear integer problem ⋮ On the exact solution of large-scale simple plant location problems ⋮ Dantzig-Wolfe decomposition for the facility location and production planning problem ⋮ The capacitated plant location problem ⋮ The capacitated plant location problem with multiple facilities in the same site ⋮ Locating Satellite Yards in Forestry Operations ⋮ A branch-and-bound method for discretely-constrained mathematical programs with equilibrium constraints ⋮ Approximate solutions to large scale capacitated facility location problems ⋮ Exact algorithms for the joint object placement and request routing problem in content distribution networks ⋮ Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem ⋮ Exact and heuristic solution approaches for the mixed integer setup knapsack problem ⋮ Locational analysis ⋮ Preprocessing for a map sectorization problem by means of mathematical programming ⋮ Decomposition in global optimization ⋮ Dynamic-demand capacitated facility location problems with and without relocation ⋮ RAMP algorithms for the capacitated facility location problem ⋮ Experiments with primal - dual decomposition and subgradient methods for the uncapacitatied facility location problem ⋮ Location and sizing of offshore platforms for oil exploration ⋮ The determination of optimal treatment plans for volumetric modulated arc therapy (VMAT) ⋮ A fuzzy set-theoretic method for public facility location ⋮ An integrated evaluation of facility location, capacity aquisition, and technology selection for designing global manufacturing strategies ⋮ A new cross decomposition method for stochastic mixed-integer linear programming ⋮ Linear mean value cross decomposition: A generalization of the Kornai- Liptak method ⋮ Capacitated facility location/network design problems. ⋮ Benders decomposition algorithms for two variants of the single allocation hub location problem ⋮ A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs ⋮ Facility location models for distribution system design ⋮ Capacity planning with congestion effects ⋮ Capacitated facility location problem with general setup cost ⋮ Benders decomposition, Lagrangean relaxation and metaheuristic design ⋮ Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers ⋮ A Benders decomposition approach for a distribution network design problem with consolidation and capacity considerations ⋮ A heuristic preprocessor supported algorithm for the capacitated plant location problem ⋮ Capacitated multi-period maximal covering location problem with server uncertainty ⋮ A new method for solving capacitated location problems based on a set partitioning approach ⋮ Lagrangean heuristics for location problems ⋮ Effects of feasibility cuts in Lagrangian relaxation for a two-stage stochastic facility location and network flow problem ⋮ Valid inequalities and facets of the capacitated plant location problem ⋮ 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 ⋮ Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type ⋮ Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing ⋮ On the convergence of cross decomposition ⋮ A computational evaluation of a general branch-and-price framework for capacitated network location problems ⋮ Optimal location with equitable loads ⋮ A dual simplex algorithm for the canonical representation of the uncapacitated facility location problem ⋮ A multi-product loading problem: A model and solution method ⋮ Cross decomposition for mixed integer programming ⋮ A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem ⋮ Heuristics for the capacitated plant location model ⋮ Uncapacitated and Capacitated Facility Location Problems ⋮ Planning and scheduling packaging lines in food industry ⋮ 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
This page was built for publication: A Cross Decomposition Algorithm for Capacitated Facility Location
