| Name | glass4 |
| Download | glass4.mps.gz |
| Solution | glass4.sol.gz |
| Orginator | I. Luzzi |
| Formulator | I. Luzzi |
| Donator | Andrea Lodi |
| Rows | 396 |
| Cols | 322 |
| Non-zeros | 1815 |
| Integers | |
| Binaries | 302 |
| Continuous | |
| |Min| | 1.00000000e+00 |
| |Max| | 8.40000000e+06 |
| Integer Objective | 1200012600 |
| LP Objective | 800002400 |
| Root LP Basis | glass4.bas.gz |
| Set partitioning | 36 |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Upper bounds | |
| Lower bounds | |
| Mixed 0/1 | 360 |
| General Cons. | |
| References | FischettiLodi2002 Luzzi2003 Vazacopoulos2006 |
nesting instance
Ryuhei Miyashiro computed the optimal solution with a specialized heuristic. Proving optimimality is possible with CPLEX 10.0 within an hour.
Suggested settings are:
emphasis numerical yes
mip strategy presolvenode 2
mip strategy probe 3
mip tolerances absmipgap 0
mip tolerances integrality 0
mip tolerances mipgap 0
preprocessing repeatpresolve 3
simplex tolerances feasibility 1e-9
Alkis Vazacopoulos reports solving this instance using XPRESS 2006B in 7 hours on a 2 processor Xeon system with the following settings: no cuts, best first node selection, heavy strong branching, and variable selection based on up+down pseudo-costs.