A Cross Decomposition Algorithm for Capacitated Facility Location
From MaRDI portal
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
Cited in
(87)- A genetic algorithm for a single product network design model with lead time and safety stock considerations
- A computational evaluation of a general branch-and-price framework for capacitated network location problems
- Optimal location with equitable loads
- Heuristics for the capacitated plant location model
- 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
- Locational analysis
- Decomposition in global optimization
- Location and sizing of offshore platforms for oil exploration
- 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
- Linear mean value cross decomposition: A generalization of the Kornai- Liptak method
- Valid inequalities and facets of the capacitated plant location problem
- Creative modeling: Variable and constraint duplication in primal-dual decomposition methods
- A multi-product loading problem: A model and solution method
- Planning and scheduling packaging lines in food industry
- On using approximations of the Benders master problem
- Solving the staircase cost facility location problem with decomposition and piecewise linearization
- Multi-item capacitated lot-sizing by a cross decomposition based algorithm
- Location and layout planning. A survey
- A model for the capacitated p-facility location problem in global environments
- 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
- Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers
- Design of a distribution network using primal-dual decomposition
- Lagrangean heuristics for location problems
- 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
- Facility location with increasing production costs
- The capacitated plant location problem with multiple facilities in the same site
- The determination of optimal treatment plans for volumetric modulated arc therapy (VMAT)
- 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
- Capacitated multi-period maximal covering location problem with server uncertainty
- RAMP algorithms for the capacitated facility location problem
- Benders decomposition, Lagrangean relaxation and metaheuristic design
- 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
- Effects of feasibility cuts in Lagrangian relaxation for a two-stage stochastic facility location and network flow problem
- A dual simplex algorithm for the canonical representation of the uncapacitated facility location problem
- A Lagrangian heuristic for the capacitated plant location problem with single source constraints
- A cross decomposition algorithm for a multiproduct-multitype facility location problem
- A branch-and-bound method for discretely-constrained mathematical programs with equilibrium constraints
- Capacitated facility location problem with general setup cost
- Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems
- Dantzig-Wolfe decomposition for the facility location and production planning problem
- Add/drop procedures for the capacitated plant location problem
- Experiments with primal - dual decomposition and subgradient methods for the uncapacitatied facility location problem
- Dynamic-demand capacitated facility location problems with and without relocation
- Benders decomposition without separability: a computational study for capacitated facility location problems
- A Decomposition Algorithm for a Discrete Location-Allocation Problem
- scientific article; zbMATH DE number 4204108 (Why is no real title available?)
- 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 hybrid approach of bundle and Benders applied large mixed linear integer problem
- scientific article; zbMATH DE number 527371 (Why is no real title available?)
- scientific article; zbMATH DE number 2154248 (Why is no real title available?)
- scientific article; zbMATH DE number 949665 (Why is no real title available?)
- Cross decomposition for mixed integer programming
- scientific article; zbMATH DE number 1866926 (Why is no real title available?)
- Preprocessing for a map sectorization problem by means of mathematical programming
- Dynamic mean value cross decomposition algorithm for capacitated facility location problems
- Uncapacitated and capacitated facility location problems
- Capacitated facility location/network design problems.
- Capacity planning with congestion effects
- A new method for solving capacitated location problems based on a set partitioning approach
- Locating Satellite Yards in Forestry Operations
- Solution of stochastic facility location problems with combinatorially many decision-dependent distributions
- Evacuation network design under road capacity improvement and uncertainty: second-order cone programming reformulations and Benders decomposition
- Facility location models for distribution system design
- A novel Pareto-optimal cut selection strategy for Benders decomposition
- Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing
- On the convergence of cross decomposition
- Cross decomposition applied to the stochastic transportation problem
- 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
- Developing new formulations and relaxations of single stage capacitated warehouse location problem (SSCWLP): empirical investigation for assessing relative strengths and computational effort
- A branch-and-price algorithm for the capacitated facility location problem
- A perturbation-based heuristic for the capacitated multisource Weber problem
- Approximate solutions to large scale capacitated facility location problems
- 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
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)
