On Feb 5, 2013 7:29 PM, "Michael Hennebry" <[email protected]> wrote: > > If you really need integers to do your constraint generation, > add the test to your GLP_IROWGEN routine. > If you do not have integers, do not add any cuts. > > You probably do not need integers. > Loop constraints, i.e. cycle-breaking constraints, > can be generated for fractional solutions. > x12 + x23 + x31 <= 2 is a valid cycle-breaking constraint > and will cut off x12=x23=x31=0.7 . > > Doing so can speed things up. >
Thanks for that. Like I said my problem only resembles the TSP, for example nodes can be visited multiple times. I'll see if I can understand what the above does and if it applies in my case. Have a nice day, -- Martijn van Oosterhout <[email protected]>
_______________________________________________ Help-glpk mailing list [email protected] https://lists.gnu.org/mailman/listinfo/help-glpk
