Pages that link to "Item:Q1753455"

The following pages link to Solving the maximum min-sum dispersion by alternating formulations of two different problems (Q1753455):

Displayed 10 items.

• Packing unequal rectangles and squares in a fixed size circular container using formulation space search (Q1652609) ‎ (← links)
• The balanced maximally diverse grouping problem with block constraints (Q2031070) ‎ (← links)
• Less is more approach in optimization: a road to artificial intelligence (Q2070138) ‎ (← links)
• A new mixed-integer programming formulation for the maximally diverse grouping problem with attribute values (Q2095925) ‎ (← links)
• Packing a fixed number of identical circles in a circular container with circular prohibited areas (Q2329665) ‎ (← 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 review on discrete diversity and dispersion maximization from an OR perspective (Q2670513) ‎ (← links)
• Maximizing single attribute diversity in group selection (Q2678607) ‎ (← links)
• A parallel variable neighborhood search approach for the obnoxious <i>p</i>‐median problem (Q6088247) ‎ (← links)