A Cross Decomposition Algorithm for Capacitated Facility Location

DOI10.1287/OPRE.34.1.145zbMATH Open0594.90022OpenAlexW2149913958MaRDI QIDQ3725832FDOQ3725832

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

Recommendations

scientific article; zbMATH DE number 2154248
A cross decomposition algorithm for a multiproduct-multitype facility location problem
Experiments with primal - dual decomposition and subgradient methods for the uncapacitatied facility location problem
scientific article; zbMATH DE number 949665
scientific article; zbMATH DE number 975772

capacitated facility location computational results Lagrangean relaxation dual ascent method plant location cross decomposition method adjustment procedure dual subproblem primal subproblem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Inventory, storage, reservoirs (90B05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Cited In (82)

A cross decomposition algorithm for a multiproduct-multitype facility location problem
A multi-product loading problem: A model and solution method
A Benders decomposition approach for a distribution network design problem with consolidation and capacity considerations
Design of a distribution network using primal-dual decomposition
Capacitated facility location problem with general setup cost
Facility location models for distribution system design
Capacitated facility location/network design problems.
Cross decomposition for mixed integer programming
A genetic algorithm for a single product network design model with lead time and safety stock considerations
Capacity planning with congestion effects
Heuristics for the capacitated plant location model
Experiments with primal - dual decomposition and subgradient methods for the uncapacitatied facility location problem
Approximate solutions to large scale capacitated facility location problems
Developing new formulations and relaxations of single stage capacitated warehouse location problem (SSCWLP): empirical investigation for assessing relative strengths and computational effort
An algorithm for solving large capacitated warehouse location problems
On the exact solution of large-scale simple plant location problems
Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
Optimal location with equitable loads
Cross decomposition applied to the stochastic transportation problem
Lagrangean heuristics for location problems
On the convergence of cross decomposition
Uncapacitated and capacitated facility location problems
Preprocessing for a map sectorization problem by means of mathematical programming
A branch-and-price algorithm for the capacitated facility location problem
Linear mean value cross decomposition: A generalization of the Kornai- Liptak method
Benders decomposition without separability: a computational study for capacitated facility location problems
A robust optimisation model and cutting planes for the planning of energy-efficient wireless networks
A branch-and-bound method for discretely-constrained mathematical programs with equilibrium constraints
An integrated evaluation of facility location, capacity aquisition, and technology selection for designing global manufacturing strategies
Location and layout planning. A survey
Valid inequalities and facets of the capacitated plant location problem
A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem
A new cross decomposition method for stochastic mixed-integer linear programming
A comparison of heuristics and relaxations for the capacitated plant location problem
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
Optimal Physician assignment and patient demand allocation in an outpatient care network
Solving a dynamic facility location problem with partial closing and reopening
Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem
A Decomposition Algorithm for a Discrete Location-Allocation Problem
A new method for solving capacitated location problems based on a set partitioning approach
An optimal algorithm for the multiproduct capacitated facility location problem with a choice of facility type
Decomposition in global optimization
Locational analysis
A perturbation-based heuristic for the capacitated multisource Weber problem
Exact algorithms for the joint object placement and request routing problem in content distribution networks
Exact and heuristic solution approaches for the mixed integer setup knapsack problem
A computational evaluation of a general branch-and-price framework for capacitated network location problems
On using approximations of the Benders master problem
Multi-item capacitated lot-sizing by a cross decomposition based algorithm
Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing
Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers
A hybrid approach of bundle and Benders applied large mixed linear integer problem
Location and sizing of offshore platforms for oil exploration
A fuzzy set-theoretic method for public facility location
A Lagrangian heuristic for the capacitated plant location problem with single source constraints
The capacitated plant location problem
Facility location with increasing production costs
Planning and scheduling packaging lines in food industry
A model for the capacitated \(p\)-facility location problem in global environments
Benders decomposition, Lagrangean relaxation and metaheuristic design
Title not available (Why is that?)
Dynamic-demand capacitated facility location problems with and without relocation
Modelling a fertiliser distribution system
Solving the staircase cost facility location problem with decomposition and piecewise linearization
Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems
The capacitated plant location problem with multiple facilities in the same site
The determination of optimal treatment plans for volumetric modulated arc therapy (VMAT)
Add/drop procedures for the capacitated plant location problem
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
Locating Satellite Yards in Forestry Operations
RAMP algorithms for the capacitated facility location problem
Capacitated multi-period maximal covering location problem with server uncertainty
Title not available (Why is that?)
Dynamic mean value cross decomposition algorithm for capacitated facility location problems
Dantzig-Wolfe decomposition for the facility location and production planning problem
A heuristic preprocessor supported algorithm for the capacitated plant location problem
Title not available (Why is that?)
A dual simplex algorithm for the canonical representation of the uncapacitated facility location problem
Effects of feasibility cuts in Lagrangian relaxation for a two-stage stochastic facility location and network flow problem
Title not available (Why is that?)

Uses Software

NETGEN

This page was built for publication: A Cross Decomposition Algorithm for Capacitated Facility Location

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3725832)