p0040:
References: (see our remarks)
- Hoffman, K L, and Padberg, M, Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut. ORSA Journal on Computing 3, 2 (1991).
- Crowder, H, Johnson, E L, and Padberg, M, Solving Large-Scale Zero-One Linear Programming Problems. Operations Research 31, 5 (1983).
- Andrew Boyd, E, Fenchel Cutting Planes for Integer Programs. to appear in Operations Research
- Andrew Boyd, E, Generating Fenchel Cutting Planes for Knapsack Polyhedra. to appear in the SIAM Journal on Optimization
- Andrew Boyd, E, Solving Integer Programs with Enumeration Cutting Planes.
- Miscellaneous LP Models, Hungarian Academy of Sciences OR Lab: online at ftp.sztaki.hu/oplab.
- Original source: MPS file (compressed EMPS format) p0040.gz from http://www.sztaki.hu/~meszaros/public_ftp/lptestset//misc/.
Point:
p1
Best known point: p1 with solution 61796.5451
Download model: p0040.gms
Download data : p0040.gdx, p0040.gdx.zip
Model Stats:
<![CDATA[
Equation counts
Total E G L R
23 0 0 23 0
Variable counts
Total cont binary integer sos1 sos2 scont sint
40 40 0 0 0 0 0 0
Nonzero counts
Total matrix obj
150 110 40
]]></plaintext></body></div>