Timeline for linear programming with OR restrictions
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 12, 2012 at 1:52 | comment | added | Brendan McKay | My answer was just to demonstrate that the problem is NP-hard, unlike the standard linear programming problem that is polynomial time. This knowledge is not particularly useful in practice except to eliminate possible approaches. | |
| Aug 11, 2012 at 14:56 | comment | added | ashade | Great answer, but forgive me, I don't have much knowledge in graph theory. Suppose I have a maximum independent set for this graph. What should I do next to solve my problem? Also, how can I find this maximum independent set? Thanks for you time. | |
| Aug 11, 2012 at 14:25 | history | answered | Brendan McKay | CC BY-SA 3.0 |