| Name | a1c1s1 |
| Download | a1c1s1.mps.gz |
| Orginator | M. Vyve, E. Pochet |
| Formulator | M. Vyve, E. Pochet |
| Donator | Andrea Lodi |
| Rows | 3312 |
| Cols | 3648 |
| Non-zeros | 10178 |
| Integers | |
| Binaries | 192 |
| Continuous | |
| |Min| | 1.00000000e+00 |
| |Max| | 4.80000000e+02 |
| Integer Objective | 11503.444125 |
| LP Objective | 9.97529583e+02 |
| Root LP Basis | a1c1s1.bas.gz |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Upper bounds | |
| Lower bounds | 960 |
| Mixed 0/1 | 2352 |
| General Cons. | |
| References | FischettiLodi2002 VyvePochet2001 Vazacopoulos2006 BussieckFerrisMeeraus2007 |
lot sizing instance
Alkis Vazacopoulos reports solving this instance using XPRESS 2006B.