Sparsity pattern

noswot

Namenoswot
Downloadnoswot.mps.gz
Solutionnoswot.sol.gz
Orginator
FormulatorLinus E. Schrage
DonatorJohn W. Gregory
Rows182
Cols128
Non-zeros735
Integers25
Binaries75
Continuous
|Min|2.50000000e-01
|Max|2.10000000e+01
Integer Objective-4.10000000e+01
LP Objective-4.30000000e+01
Root LP Basisnoswot.bas.gz
Set partitioning
Set packing
Set covering
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack
Knapsacks
Integer Knapsack32
Upper bounds
Lower bounds20
Mixed 0/1
General Cons.130
References

Comment from Irvin Lustig (Dec 2006):
With a little study of the model, the problem becomes easy. The summary description of what can be done can is given on pages 25 and 26 of the paper MIP: Theory and Practice - Closing the Gap (BixbyFenelonGuRothbergWunderling2000 ) while the details are found in the paper (LustigPuget2001 ).

IP optimum found by CPlex 9.0 in 14.3 CPU hours.

Comment from Robert Bixby (Dec 2003, CPlex 9.0):
noswot solves in well under an hour, but that was with a tuned setting. Default settings took more than an hour. In fact, it would be easy to conclude that noswot wasn't going to solve since the bound didn't move for almost an hour. However, there is a hint in the fact that the LP values usually differ from the bound.


Last Update : 2010/06/09 13:56:11 $ by Gerald Gamrath
© 2010 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)
Imprint