Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with linear-programming
Search options not deleted
user 27773
Linear programming is the study of optimizing a linear function over a set of linear inequalities. The Simplex Method, Ellipsoid Method and Interior Point Method are popular algorithms to solve linear programs.
2
votes
Set Cover:Greedy vs LP
This is really a comment, not an answer, but for whatever reason I see no comment field.
You can view the standard greedy set cover algorithm as a derandomization (using the method of conditional pr …
- 183
1
vote
Approximate Set Cover Problem by Rounding
Yes, I believe there are instances of set cover where optimal basic feasible solutions (vertices of the polytope) have coordinates in $(0,1/f)$. Here is (I think) an example with $f=3$.
Create 13 se …
- 183