Pages that link to "Item:Q2510152"
From MaRDI portal
The following pages link to An artificial bee colony algorithm for the maximally diverse grouping problem (Q2510152):
Displaying 14 items.
- Iterated maxima search for the maximally diverse grouping problem (Q323418) (← links)
- A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects (Q497951) (← links)
- Estimation of distribution algorithm for a class of nonlinear bilevel programming problems (Q497954) (← links)
- A mixed integer programming formulation and solution for traffic analysis zone delineation considering zone amount decision (Q507628) (← links)
- On clarifying misconceptions when comparing variants of the artificial bee colony algorithm by offering a new implementation (Q508802) (← links)
- Heuristic search to the capacitated clustering problem (Q1622798) (← links)
- Solving the capacitated clustering problem with variable neighborhood search (Q1730629) (← links)
- Neighborhood decomposition based variable neighborhood search and tabu search for maximally diverse grouping (Q2029286) (← links)
- A new mixed-integer programming formulation for the maximally diverse grouping problem with attribute values (Q2095925) (← links)
- A three-phase search approach with dynamic population size for solving the maximally diverse grouping problem (Q2672118) (← links)
- The balanced maximally diverse grouping problem with attribute values (Q6046134) (← links)
- Population-based iterated greedy algorithm for the S-labeling problem (Q6164608) (← links)
- The balanced maximally diverse grouping problem with integer attribute values (Q6166203) (← links)
- Efficient neighborhood evaluation for the maximally diverse grouping problem (Q6644387) (← links)
