Pages that link to "Item:Q1044245"
From MaRDI portal
The following pages link to An effective heuristic for large-scale capacitated facility location problems (Q1044245):
Displaying 16 items.
- Benders decomposition without separability: a computational study for capacitated facility location problems (Q323204) (← links)
- Restructuring bank networks after mergers and acquisitions: a capacitated delocation model for closing and resizing branches (Q337674) (← links)
- Observations on some heuristic methods for the capacitated facility location problem (Q505112) (← links)
- A hybrid firefly-genetic algorithm for the capacitated facility location problem (Q508597) (← links)
- A cutting plane algorithm for the capacitated facility location problem (Q842775) (← links)
- The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation (Q1630276) (← links)
- A computational study of a nonlinear minsum facility location problem (Q1761206) (← links)
- Capacitated clustering problem in computational biology: combinatorial and statistical approach for sibling reconstruction (Q1762010) (← links)
- An aggregation heuristic for large scale p-median problem (Q1762151) (← links)
- An improved Lagrangian relaxation and dual ascent approach to facility location problems (Q1789574) (← links)
- Some heuristic methods for solving \(p\)-median problems with a coverage constraint (Q1926741) (← links)
- Near-optimal large-scale k-medoids clustering (Q2054038) (← links)
- RAMP algorithms for the capacitated facility location problem (Q2240709) (← links)
- Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems (Q2267294) (← links)
- Towards a machine learning-aided metaheuristic framework for a production/distribution system design problem (Q2676294) (← links)
- Matheuristics: survey and synthesis (Q6056873) (← links)
