Pages that link to "Item:Q3157781"
From MaRDI portal
The following pages link to Lagrangean heuristics applied to a variety of large capacitated plant location problems (Q3157781):
Displayed 10 items.
- A perturbation-based heuristic for the capacitated multisource Weber problem (Q864040) (← links)
- Region-rejection based heuristics for the capacitated multi-source Weber problem (Q1000993) (← links)
- Upper and lower bounds for the single source capacitated location problem. (Q1410616) (← links)
- A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem (Q1695027) (← links)
- A maximal covering location model in the presence of partial coverage (Q1881656) (← links)
- A cut-and-solve based algorithm for the single-source capacitated facility location problem (Q1926885) (← links)
- Solving the facility location and fixed charge solid transportation problem (Q1983711) (← links)
- Benders decomposition, Lagrangean relaxation and metaheuristic design (Q2271124) (← links)
- Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities (Q4599310) (← links)
- Defining tabu list size and aspiration criterion within tabu search methods (Q5955472) (← links)
