[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [Help-glpk] linear ordering problem again
From: |
Yingjie Lan |
Subject: |
Re: [Help-glpk] linear ordering problem again |
Date: |
Mon, 8 Feb 2010 03:07:48 -0800 (PST) |
> I think that the 22-node example is too easy for both glpk
> and the
> b&b code you used. Solving larger instances having
> 40-50 nodes would be
> more interesting. (Playing with lolib I noticed that
> instances with 0-1
> weights are much harder for solving with b&b.)
>
> FYI: The new version of LOLIB is available at:
> http://heur.uv.es/optsicom/LOLIB/
>
I agree. I tried other problems and they are very hard.
If I have a really good heuristic solution, how can I take advantage of it with
GLPK API (for example, how to use that to help with pruning the tree)?
Yingjie
- [Help-glpk] linear ordering problem again, Yingjie Lan, 2010/02/06
- Re: [Help-glpk] linear ordering problem again, Yingjie Lan, 2010/02/07
- Re: [Help-glpk] linear ordering problem again, Andrew Makhorin, 2010/02/07
- Re: [Help-glpk] linear ordering problem again,
Yingjie Lan <=
- Re: [Help-glpk] linear ordering problem again, Yingjie Lan, 2010/02/09
- Re: [Help-glpk] linear ordering problem again, Andrew Makhorin, 2010/02/09
- Re: [Help-glpk] linear ordering problem again, Yingjie Lan, 2010/02/09
- Re: [Help-glpk] linear ordering problem again, Andrew Makhorin, 2010/02/10
- Re: [Help-glpk] linear ordering problem again, Yingjie Lan, 2010/02/10