[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re[4]: [Help-glpk] LPP & MIP
|
From: |
Andrew Makhorin |
|
Subject: |
Re[4]: [Help-glpk] LPP & MIP |
|
Date: |
Sat, 31 Jul 2004 07:36:25 +0400 |
I believe that a mip presolver could not simplify your instance
bpp25. The bin packing is a hard combinatorial optimization problem,
and presolving could not help in this case (as a rule). Btw, the greedy
heuristic obtained a sub-optimal solution 13, while the global bound is
11, i.e. the exact optimum for your instance can be only 11, 12, or 13.