Tagged Questions
2
votes
1answer
69 views
Maximizing the number of non-crossing lines between a number of points
Suppose I have a number of points in 2-dimensional space. I want to draw as many lines between the points as possible such that no two lines cross.
Hoping for a polynomial time algorithm, I ...
1
vote
2answers
44 views
What's the relation between the non-convex sets and the hardness of ILP problems?
If some or all of the unknown variables are required to be integers,
then the problem is called an integer programming (IP) or integer
linear programming (ILP) problem.
If understand ...
