It might demand a bit of effort, but the GSL simulated annealing
routines would be adaptable to this type of problem. In fact, the
traveling salesman example in the manual is a discrete problem as
well.
HTH,
- Andrew Steiner
(c.f. O2scl at
http://o2scl.sourceforge.net)
On Tue, Sep 16, 2008 at 9:08 AM, Peter <rumbelstilzchen@........> wrote:
> I've got a very special function and for that I can only accept solutions and steps consisting of integers and not of double.
>
> Any idea of how I can achieve this?
>
> For now only the initial step works, as I can set it to 1.
>
> __________________________________________________
> Do You Yahoo!?
> Sie sind Spam leid? Yahoo! Mail verfügt über einen herausragenden Schutz gegen Massenmails.
>
http://mail.yahoo.com
>
>
> _______________________________________________
> Help-gsl mailing list
> Help-gsl@gnu.org
>
http://lists.gnu.org/mailman/listinfo/help-gsl
>
