Pages that link to "Item:Q1124811"
From MaRDI portal
The following pages link to An exact algorithm for the capacitated facility location problems with single sourcing (Q1124811):
Displaying 12 items.
- A Computational Investigation on the Strength of Dantzig-Wolfe Reformulations (Q5140720) (← links)
- A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints (Q5158761) (← links)
- Exact algorithms for integrated facility location and production planning problems (Q5198685) (← links)
- A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem (Q5704227) (← links)
- The value of the multi-period solution revisited: when to model time in capacitated location problems (Q6065619) (← links)
- Designing service system networks with interruption risks (Q6066674) (← links)
- Optimizing a multi-echelon location-inventory problem with joint replenishment: a Lipschitz \(\epsilon\)-optimal approach using Lagrangian relaxation (Q6109334) (← links)
- Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing (Q6113311) (← links)
- Locating Satellite Yards in Forestry Operations (Q6160212) (← links)
- Modeling and solving an economies‐of‐scale service system design problem (Q6187314) (← links)
- Enhanced capacitated facility location problem for mental accounting management using partial resource concentration (Q6546998) (← links)
- Fast heuristics for the time-constrained immobile server problem (Q6659813) (← links)