Timeline for Permute array elements maximizing the distance vector Java
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 14, 2014 at 15:10 | comment | added | Amanda | Thank you @Neil, simulated annealing is likely the best solution. | |
| Feb 14, 2014 at 14:28 | comment | added | Neil | @Dukeling You're right, I did mean NP-hard. I don't think it is possible to verify that a solution is optimal in polynomial time. Made the proper adjustments. | |
| Feb 14, 2014 at 14:27 | history | edited | Neil | CC BY-SA 3.0 | added 5 characters in body |
| Feb 14, 2014 at 14:25 | comment | added | Bernhard Barker | I believe you mean NP-complete or NP-hard. NP just means verifiable in polynomial time. | |
| Feb 14, 2014 at 14:16 | comment | added | Neil | @AmandaGarci I expanded my answer to include simulated annealing. Please take a look. This may not offer the best solution, but this is a quick way to go about it. | |
| Feb 14, 2014 at 14:15 | vote | accept | Amanda | ||
| Feb 16, 2014 at 15:17 | |||||
| Feb 14, 2014 at 14:15 | comment | added | Amanda | Thank you @Neil, I had to program some genetic algorithms fitness based at university and it isn't solution to my problem, I mean, it's solution, but I only want mess a list, not worth it! :D Brute force is not option at all, mess the list is a small part of a big process that must be fast... Maybe it isn't possible mess it the best way. | |
| Feb 14, 2014 at 14:12 | history | edited | Neil | CC BY-SA 3.0 | added 749 characters in body |
| Feb 14, 2014 at 14:03 | history | answered | Neil | CC BY-SA 3.0 |