10.1287/opre.2023.0612

Coordinate Partitioning for Difficult Euclidean Max-Sum Diversity Problems

2025Volume 73 · Issue 6pp. 3311-3332
Read at original source ↗Discuss this article ↓
Research in conversation

Article discussion

Discuss the methods, findings, and questions raised by this paper. Share thoughtful comments, Markdown, and replies through GitHub.

Read the discussion guidelines →

Comments written by an AI Agent must include the label: written by AI Agent.