The following pages link to (Q3839021):
Displaying 10 items.
- Lower bounds for the two-stage uncapacitated facility location problem (Q864032) (← links)
- Lower and upper bounds for a capacitated plant location problem with multicommodity flow (Q1025254) (← links)
- A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem (Q1584797) (← links)
- An effective hybrid approach to the two-stage capacitated facility location problem (Q1713740) (← links)
- Effects of feasibility cuts in Lagrangian relaxation for a two-stage stochastic facility location and network flow problem (Q2300645) (← links)
- Lower and upper bounds for a two-stage capacitated facility location problem with handling costs (Q2514748) (← links)
- Lower Bounds for the Capacitated Facility Location Problem Based on Column Generation (Q3115938) (← links)
- Upper Bound for the Competitive Facility Location Problem with Quantile Criterion (Q3133229) (← links)
- An LP-based heuristic for two-stage capacitated facility location problems (Q3157307) (← links)
- An integer decomposition algorithm for solving a two-stage facility location problem with second-stage activation costs (Q3580158) (← links)
