Pages that link to "Item:Q750288"
From MaRDI portal
The following pages link to Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing (Q750288):
Displaying 15 items.
- Solving a dynamic facility location problem with partial closing and reopening (Q342268) (← links)
- Discrete location for bundled demand points (Q611011) (← links)
- Facility location models for distribution system design (Q707128) (← links)
- Tight bounds from a path based formulation for the tree of hub location problem (Q833527) (← links)
- Scatter search for the single source capacitated facility location problem (Q940848) (← links)
- On the exact solution of large-scale simple plant location problems (Q1121152) (← links)
- Some personal views on the current state and the future of locational analysis (Q1291654) (← links)
- A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem (Q1584797) (← links)
- An improved cut-and-solve algorithm for the single-source capacitated facility location problem (Q1742898) (← links)
- Lagrangean heuristics for location problems (Q1804069) (← links)
- Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type (Q1809805) (← links)
- A new extended formulation with valid inequalities for the capacitated concentrator location problem (Q2029271) (← links)
- A novel differential evolution algorithm for binary optimization (Q2376130) (← links)
- On the capacitated concentrator location problem: a reformulation by discretization (Q2496022) (← links)
- Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities (Q4599310) (← links)
