Alternatively, you run optimize() just once as usual and then query the number
of available solutions through the "SolCount" attribute. Then, you loop over the
values 0 to SolCount-1 and:
1. Set the "SolutionNumber" parameter, see
http://www.gurobi.com/documentation/6.0/refman/solutionnumber.html
2. Query the solution via the "Xn" attribute:
http://www.gurobi.com/documentation/6.0/refman/xn.html
Regards,
Tobias
> <
http://www.gurobi.com/products/gurobi-optimizer/features-and-benefits>,
> it says "Solution pool provides access to multiple feasible
> solutions" in Mixed-integer model.
> Is it a new function? because there are some issues about access
> multiple solutions were discussed in this forum, but all the
> conclusions didn't said any function about "solution pool", and I
> also can't find any information about solution pool from reference
> manual.
> To access multiple solutions of an ILP problem, I know it can get
> all solutions by cutting plane one by one, is there another more
> efficient way?
>
> Thanks
>
> --
>
> ---
> You received this message because you are subscribed to the Google Groups
> "Gurobi Optimization" group.
> To unsubscribe from this group and stop receiving emails from it, send an email
> to
gurobi+un...@googlegroups.com <mailto:
gurobi+un...@googlegroups.com>.
> For more options, visit
https://groups.google.com/d/optout.
--
-----------------------------------------------------------------
Dr. Tobias Achterberg
Senior Software Developer
Gurobi Optimization
achte...@gurobi.com
-----------------------------------------------------------------
Sitz der Gesellschaft: Bad Homburg v.d.H.
Registergericht: Bad Homburg v.d.H., HRB 12607
Geschäftsführer: Robert E. Bixby, Dirk Zechiel