Pages that link to "Item:Q3725832"
From MaRDI portal
The following pages link to A Cross Decomposition Algorithm for Capacitated Facility Location (Q3725832):
Displaying 30 items.
- Facility location with increasing production costs (Q1869420) (← links)
- The capacitated plant location problem with multiple facilities in the same site (Q1941959) (← links)
- The determination of optimal treatment plans for volumetric modulated arc therapy (VMAT) (Q1991143) (← links)
- Benders decomposition algorithms for two variants of the single allocation hub location problem (Q2005805) (← links)
- A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs (Q2010085) (← links)
- Capacitated multi-period maximal covering location problem with server uncertainty (Q2029288) (← links)
- RAMP algorithms for the capacitated facility location problem (Q2240709) (← links)
- Benders decomposition, Lagrangean relaxation and metaheuristic design (Q2271124) (← links)
- A Benders decomposition approach for a distribution network design problem with consolidation and capacity considerations (Q2275582) (← links)
- A heuristic preprocessor supported algorithm for the capacitated plant location problem (Q2276874) (← links)
- Effects of feasibility cuts in Lagrangian relaxation for a two-stage stochastic facility location and network flow problem (Q2300645) (← links)
- A dual simplex algorithm for the canonical representation of the uncapacitated facility location problem (Q2314413) (← links)
- A Lagrangian heuristic for the capacitated plant location problem with single source constraints (Q2367382) (← links)
- A cross decomposition algorithm for a multiproduct-multitype facility location problem (Q2368114) (← links)
- A branch-and-bound method for discretely-constrained mathematical programs with equilibrium constraints (Q2442073) (← links)
- Capacitated facility location problem with general setup cost (Q2496021) (← links)
- Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems (Q2640440) (← links)
- Dantzig-Wolfe decomposition for the facility location and production planning problem (Q2664417) (← links)
- Add/drop procedures for the capacitated plant location problem (Q2741478) (← links)
- Experiments with primal - dual decomposition and subgradient methods for the uncapacitatied facility location problem (Q2743665) (← links)
- Dynamic-demand capacitated facility location problems with and without relocation (Q3005806) (← links)
- A Decomposition Algorithm for a Discrete Location-Allocation Problem (Q3337913) (← links)
- (Q3352833) (← links)
- Cross decomposition for mixed integer programming (Q4742563) (← links)
- (Q4792361) (← links)
- Uncapacitated and Capacitated Facility Location Problems (Q5506717) (← links)
- Capacitated facility location/network design problems. (Q5928375) (← links)
- Capacity planning with congestion effects (Q5945855) (← links)
- A new method for solving capacitated location problems based on a set partitioning approach (Q5959081) (← links)
- Locating Satellite Yards in Forestry Operations (Q6160212) (← links)