New integer linear programming formulations for the maximally diverse grouping problem

DOI10.1007/S10878-026-01427-2MaRDI QIDQ7314349zbMATH OpenFDO

Authors Kevin Fu Yuan Lam, Jiang Qian

Publication date 14 August 2026

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10878-026-01427-2

Mathematics Subject Classification ID

Linear programming (90C05) Integer programming (90C10) Quadratic programming (90C20) Combinatorial optimization (90C27)

Cites work

• A class of bounded approximation algorithms for graph partitioning
• A cutting plane algorithm for a clustering problem
• A new mixed-integer programming formulation for the maximally diverse grouping problem with attribute values
• An artificial bee colony algorithm for the maximally diverse grouping problem
• An empirical comparison of heuristic methods for creating maximally diverse groups
• Combinatorics, complexity, and randomness
• Neighborhood decomposition based variable neighborhood search and tabu search for maximally diverse grouping
• Solving the clique partitioning problem as a maximally diverse grouping problem

This page was built for publication: New integer linear programming formulations for the maximally diverse grouping problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7314349)