>
> If I wanted to change the last constraint to be w[0]-w[1]-w[2]>=1 can I do
> this without resetting the whole p?
>
Not for the moment, but this can be added with a small patch. We just need
to expose the functions from the solver's API :-)
Nathann
--
To post to this group, send email to sag
I didn't know that SAGE could handle MILP (awesome!), I'm just playing
around with it now and was wondering if there was a way to remove a
constrain from a particular problem or indeed modify it without reseting
the whole problem.
For example:
Say I wanted to solve the problem described in the on
>
> Sage has a class name 'Mixed integer linear programming' for modeling
> MIPs and class for LP Solver backends like Co-in, CPLEX, GLPK and Gurobi.
> At the moment I haven't know any sage class only for vehicle routing
> problem.
>
Yep ! There's a short tutorial about its use there
: http://
Chris,
Sage has a class name 'Mixed integer linear programming' for modeling MIPs
and class for LP Solver backends like Co-in, CPLEX, GLPK and Gurobi.
At the moment I haven't know any sage class only for vehicle routing
problem.
Raniere Gaia Costa da Silva
--
To post to this group, send email to
Hi,
Does anyone know of research being done in sage on combinatorial
optimization like the traveling salesman and vehicle routing problems?
Thanks,
Chris
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+unsubscr...
