Pages that link to "Item:Q1751715"
From MaRDI portal
The following pages link to Effective metaheuristic algorithms for the minimum differential dispersion problem (Q1751715):
Displayed 11 items.
- Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem (Q1755228) (← links)
- Parallel iterative solution-based Tabu search for the obnoxious \(p\)-median problem (Q2027024) (← links)
- The balanced maximally diverse grouping problem with block constraints (Q2031070) (← links)
- A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem (Q2195439) (← links)
- A hybrid metaheuristic of integrating estimation of distribution algorithm with Tabu search for the max-mean dispersion problem (Q2298725) (← links)
- Tabu search guided by reinforcement learning for the max-mean dispersion problem (Q2666721) (← links)
- Bi-objective optimization of biclustering with binary data (Q2666768) (← links)
- A two-phase intensification tabu search algorithm for the maximum min-sum dispersion problem (Q2669523) (← links)
- Solving the capacitated dispersion problem with variable neighborhood search approaches: from basic to skewed VNS (Q2669792) (← links)
- A vertex weighting-based double-tabu search algorithm for the classical \(p\)-center problem (Q6068702) (← links)
- A flow based formulation and a reinforcement learning based strategic oscillation for cross-dock door assignment (Q6090150) (← links)