Timeline for Im looking for an algorithm that can solve or approximate the solution to a problem
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 14, 2019 at 18:51 | comment | added | RobPratt | create data SolutionIngredientsAll from [n i]={n in 1.._NSOL_, i in INGREDIENTS: UseIngredient[i].sol[n] > 0.5}; | |
| Nov 14, 2019 at 17:04 | comment | added | Dangz1 |
Yes, I used sas online. I see that there are often multiple solutions for a given k. I was able to use UseIngredient[i].sol[n] to get data for solution $n$ but I cant figure out how to pull data from all solutions to a single data set using create data data_name from... syntax. Do you know how to do that?
|
|
| Nov 8, 2019 at 13:18 | comment | added | RobPratt | Yes, I got 1345, too, when I did not exclude any data. Glad to help. Did you use SAS? | |
| Nov 8, 2019 at 11:40 | vote | accept | Dangz1 | ||
| Nov 8, 2019 at 11:40 | comment | added | Dangz1 | Code works though for $k = 200$ Ive gotten a bit different result of 1345. Thanks for your help. | |
| Nov 7, 2019 at 19:04 | history | edited | RobPratt | CC BY-SA 4.0 |
added 1359 characters in body
|
| Nov 5, 2019 at 20:59 | comment | added | RobPratt | Yes, the $x_i \le y_j$ constraint applies to each such door-key pair. For example, door 1 has three constraints: $x_1 \le y_A, x_1 \le y_B, x_1 \le y_C$. | |
| Nov 5, 2019 at 20:30 | comment | added | Dangz1 | This works for doors needing multiple keys to open? | |
| Nov 5, 2019 at 19:55 | history | answered | RobPratt | CC BY-SA 4.0 |