Pages that link to "Item:Q342539"
From MaRDI portal
The following pages link to A hybrid of max-min ant system and linear programming for the \(k\)-covering problem (Q342539):
Displaying 6 items.
- A hybrid method for the probabilistic maximal covering location-allocation problem (Q337483) (← links)
- HMS: a hybrid multi-start algorithm for solving binary linear programs (Q1791895) (← links)
- (Q4495193) (← links)
- (Q5696416) (← links)
- MLQCC: an improved local search algorithm for the set <i>k</i>‐covering problem (Q6088120) (← links)
- Optimizing a binary integer program by identifying its optimal core problem -- a new optimization concept applied to the multidimensional knapsack problem (Q6629013) (← links)