Pages that link to "Item:Q2489136"
From MaRDI portal
The following pages link to Bounds for the single source modular capacitated plant location problem (Q2489136):
Displaying 11 items.
- Solution method for the location planning problem of logistics park with variable capacity (Q339598) (← links)
- Upper and lower bounds for the single source capacitated location problem. (Q1410616) (← links)
- A Lagrangean heuristic for a modular capacitated location problem (Q1413757) (← links)
- The continuous single source location problem with capacity and zone-dependent fixed cost: models and solution approaches (Q1695018) (← links)
- The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem (Q2327679) (← links)
- Location of slaughterhouses under economies of scale (Q2433439) (← links)
- Stochastic facility location with general long-run costs and convex short-run costs (Q2475855) (← links)
- Discretized formulations for capacitated location problems with modular distribution costs (Q2655611) (← links)
- Using logic-based Benders decomposition to solve the capacity- and distance-constrained plant location problem (Q2815453) (← links)
- Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities (Q4599310) (← links)
- A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem (Q4656678) (← links)
