Thank you for your answer,
On Thu, 19 Jan 2006, Andrew Makhorin wrote:
This feature will be implemented in a next release.
Sounds great!
The lower bound obtained from a relaxation is only a bound. Its value
may depend, for example, on transformations performed by presolver or
on cutting
The lower bound obtained from a relaxation is only a bound. Its value
may depend, for example, on transformations performed by presolver or
on cutting planes added to the relaxation. So it does not express any
essential information.
I agree with you, but when using cplex I use it as an
Hello,
is there any experience in solving Prize Collectioning TSP with 50 nodes (or
more) with GPLK?
Or alternativly with one constraint: Cost MaxCost?
Any suggestions welcome,
Norman Heeg
___
Help-glpk mailing list
Help-glpk@gnu.org
What's new
The biggest part of the solver have been converted to pascal code.
Theses features have not been converted to pascal but are still
available in the library:
- Mathprog parser,
- IOS functions,
- IES function,
- Interior point solver,
- Harwell-Boeing parser
If you don't uses
