A new mixed-integer programming formulation for the maximally diverse grouping problem with attribute values.
Arne SchulzPublished in: Ann. Oper. Res. (2022)
Keyphrases
- attribute values
- integer programming formulation
- randomly generated
- randomly generated problems
- linear programming relaxation
- valid inequalities
- tabu search algorithm
- lower bound
- lp relaxation
- branch and bound algorithm
- numerical attributes
- feature selection
- upper bound
- traveling salesman problem
- test instances
- convex hull