[racket] shortest paths, resource allocation/scheduling

Thank you for the suggestions and discussion .
Regards.
Maurizio.

2011/12/6 Mark Engelberg <mark.engelberg at gmail.com>

> Check out Algorithm T in chapter 7.2.1.3 of Knuth, volume 4A part 1.
> Put your items into a vector, and use Algorithm T to generate the
> indices of the elements to extract.
> _________________________________________________
>  For list-related administrative tasks:
>  http://lists.racket-lang.org/listinfo/users
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.racket-lang.org/users/archive/attachments/20111206/ca3ad0a8/attachment.html>