Pages that link to "Item:Q4680751"
From MaRDI portal
The following pages link to Solving capacitated facility location problems by Fenchel cutting planes (Q4680751):
Displaying 10 items.
- Stage- and scenario-wise Fenchel decomposition for stochastic mixed 0-1 programs with special structure (Q337541) (← links)
- A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method (Q526844) (← links)
- Solving general continuous single facility location problems by cutting planes (Q1086129) (← links)
- An effective hybrid approach to the two-stage capacitated facility location problem (Q1713740) (← links)
- A cut-and-solve based algorithm for the single-source capacitated facility location problem (Q1926885) (← links)
- Fenchel decomposition for stochastic mixed-integer programming (Q1937960) (← links)
- Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes (Q1972019) (← links)
- A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes (Q2481606) (← links)
- Integer set reduction for stochastic mixed-integer programming (Q2701423) (← links)
- Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem (Q2892153) (← links)
