2
$\begingroup$

So lets say I have a certain duration of time starting at time(0) ranging to time(N). I also have a set of points whose values all exist within the range of values of that time frame.

I want to pick 4 points from that set that maximizes the distance between each point.

Just as an example say my range is 0-10 and I have points {1,2,4,5,7,9,10}. Ideally I would want to pick 1,4,7, and 10.

  • 0
    I suppose the quantity you want to maximize is $\min_{P,Q \in S} d(P,Q)$ where $S$ is the set of the points you chose. Is that correct? It looks a little unclear from the way you phrased it.2012-09-20
  • 0
    Yes I believe that is correct, I apologize I'm still trying to clarify what I am looking for myself.2012-09-20
  • 1
    This is a combinatorial optimization problem. Why the "linear programming" tag?2012-09-20
  • 0
    Sorry, didn't know what to tag it as, thought the optimization fell under linear programming2012-09-20

1 Answers 1