p0548:
References: (see our remarks)
- Bixby, R, Ceria, S, McZeal C M, and Savelsbergh, M W P, An Updated Mixed Integer Programming Library: MIPLIB 3.0. Optima 58 (1998), 12-15.
- 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.
- MIPLIB 3.0 Library, online at http://www.caam.rice.edu/~bixby/miplib/miplib.html.
- Original source: MPS file p0548 from MIPLIB 3.0.
Point:
p1
Best known point: p1 with solution 8691.0000
Download model: p0548.gms
Download data : p0548.gdx,   p0548.gdx.zip
Model Stats:
Equation counts
Total E G L R
176 0 0 176 0
Variable counts
Total cont binary integer sos1 sos2 scont sint
548 0 548 0 0 0 0 0
Nonzero counts
Total matrix obj
2127 1711 416