Pages that link to "Item:Q940848"
From MaRDI portal
The following pages link to Scatter search for the single source capacitated facility location problem (Q940848):
Displaying 16 items.
- Metaheuristic applications on discrete facility location problems: a survey (Q260627) (← links)
- A heuristic for BILP problems: the single source capacitated facility location problem (Q296777) (← links)
- A nonmonotone GRASP (Q340011) (← links)
- Heuristics for the capacitated modular hub location problem (Q1652383) (← links)
- A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem (Q1695027) (← links)
- An improved cut-and-solve algorithm for the single-source capacitated facility location problem (Q1742898) (← links)
- A new method for managing the uncertainties in evaluating multi-person multi-criteria location choices, using a perceptual computer (Q1761878) (← links)
- A cut-and-solve based algorithm for the single-source capacitated facility location problem (Q1926885) (← links)
- A multi-product production/distribution system design problem with direct shipments and lateral transshipments (Q2005789) (← links)
- A dual RAMP algorithm for single source capacitated facility location problems (Q2240710) (← links)
- The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem (Q2327679) (← links)
- A cutting plane algorithm for the capacitated connected facility location problem (Q2393652) (← links)
- Lower and upper bounds for a two-stage capacitated facility location problem with handling costs (Q2514748) (← links)
- Towards a machine learning-aided metaheuristic framework for a production/distribution system design problem (Q2676294) (← links)
- Memory and Learning in Metaheuristics (Q2866122) (← links)
- Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing (Q6113311) (← links)