Pages that link to "Item:Q4656683"
From MaRDI portal
The following pages link to A probabilistic greedy search algorithm for combinatorial optimisation with application to the set covering problem (Q4656683):
Displayed 10 items.
- Application placement and backup service in computer clustering in software as a service (SaaS) networks (Q342315) (← links)
- A hybrid heuristic for the set covering problem (Q373244) (← links)
- Exploring further advantages in an alternative formulation for the set covering problem (Q783157) (← links)
- Upper and lower bounding strategies for the generalized minimum spanning tree problem (Q817552) (← links)
- An effective and simple heuristic for the set covering problem (Q853015) (← links)
- A tabu search heuristic for the generalized minimum spanning tree problem (Q933503) (← links)
- An electromagnetism metaheuristic for the unicost set covering problem (Q976443) (← links)
- Heuristics for the variable sized bin-packing problem (Q1017465) (← links)
- A distance-limited continuous location-allocation problem for spatial planning of decentralized systems (Q1651515) (← links)
- The set covering problem revisited: an empirical study of the value of dual information (Q2514674) (← links)