POLIP

library for polynomially constrained
mixed-integer programming

polip :: contents / contributors / instances / archive / bibliography

Displaying instances of type graphpart.

Filter by type:
status name type classification vars nonlin
vars		 lin
cons		 nonlin
cons		 lin
nonzeros		 nonlin
nonzeros		 sense best primal best dual
Hard data_2g_1010_824.dimacs graphpart nc|bc|d2 301 1 100 1 201 601 min -7024864 -7024864
Hard data_2g_44_1601.dimacs graphpart nc|bc|d2 49 1 16 1 33 97 min -954077 -954077
Open data_2g_55_62.dimacs graphpart nc|bc|d2 76 1 25 1 51 151 min -1484348 -1484722
Hard data_2g_66_66.dimacs graphpart nc|bc|d2 109 1 36 1 73 217 min -2865560 -2865560
Hard data_2g_77_77.dimacs graphpart nc|bc|d2 148 1 49 1 99 295 min -3282435 -3282435
Hard data_2g_88_88.dimacs graphpart nc|bc|d2 193 1 64 1 129 385 min -5935341 -5935341
Hard data_2g_99_9211.dimacs graphpart nc|bc|d2 244 1 81 1 163 487 min -5070020 -5070020
Easy data_2pm_44_44.dimacs graphpart nc|bc|d2 49 1 16 1 33 97 min -13 -13
Easy data_2pm_55_55.dimacs graphpart nc|bc|d2 76 1 25 1 51 151 min -20 -20
status name type classification vars nonlin
vars		 lin
cons		 nonlin
cons		 lin
nonzeros		 nonlin
nonzeros		 sense best primal best dual
Easy data_2pm_66_66.dimacs graphpart nc|bc|d2 109 1 36 1 73 217 min -29 -29
Easy data_2pm_77_777.dimacs graphpart nc|bc|d2 148 1 49 1 99 295 min -40 -40
Easy data_2pm_88_888.dimacs graphpart nc|bc|d2 193 1 64 1 129 385 min -55 -55
Hard data_2pm_99_999.dimacs graphpart nc|bc|d2 244 1 81 1 163 487 min -65 -65
Hard data_3g_234_234.dimacs graphpart nc|bc|d2 73 1 24 1 49 181 min -2103694 -2103694
Hard data_3g_244_244.dimacs graphpart nc|bc|d2 97 1 32 1 65 241 min -2510946 -2510946
Hard data_3g_333_333.dimacs graphpart nc|bc|d2 82 1 27 1 55 244 min -1882389 -1882389
Hard data_3g_334_334.dimacs graphpart nc|bc|d2 109 1 36 1 73 325 min -3410696 -3410696
Hard data_3g_344_344.dimacs graphpart nc|bc|d2 145 1 48 1 97 433 min -5301516 -5301516
status name type classification vars nonlin
vars		 lin
cons		 nonlin
cons		 lin
nonzeros		 nonlin
nonzeros		 sense best primal best dual
Hard data_3g_444_444.dimacs graphpart nc|bc|d2 193 1 64 1 129 577 min -7603756 -7603756
Easy data_3pm_234_234.dimacs graphpart nc|bc|d2 73 1 24 1 49 181 min -21 -21
Easy data_3pm_244_244.dimacs graphpart nc|bc|d2 97 1 32 1 65 241 min -31 -31
Easy data_3pm_333_333.dimacs graphpart nc|bc|d2 82 1 27 1 55 244 min -26 -26
Hard data_3pm_334_334.dimacs graphpart nc|bc|d2 109 1 36 1 73 325 min -36 -36
Hard data_3pm_344_344.dimacs graphpart nc|bc|d2 145 1 48 1 97 433 min -48 -48
Hard data_3pm_444_444.dimacs graphpart nc|bc|d2 193 1 64 1 129 577 min -65 -65
Easy data_clique_20.dimacs graphpart nc|bc|d2 61 1 20 1 41 571 min 147 147
Easy data_clique_30.dimacs graphpart nc|bc|d2 91 1 30 1 61 1306 min 495 495
status name type classification vars nonlin
vars		 lin
cons		 nonlin
cons		 lin
nonzeros		 nonlin
nonzeros		 sense best primal best dual
Hard data_clique_40.dimacs graphpart nc|bc|d2 121 1 40 1 81 2341 min 1183 1183
Hard data_clique_50.dimacs graphpart nc|bc|d2 151 1 50 1 101 3676 min 2312 2312
Hard data_clique_60.dimacs graphpart nc|bc|d2 181 1 60 1 121 5311 min 3990 3990
Hard data_clique_70.dimacs graphpart nc|bc|d2 211 1 70 1 141 7246 min 6348 6348

Status:
easy instance can be solved within an hour with a general-purpose solver (to a final gap of at least 0.1%)
hard instance has been solved (to a final gap of at least 0.1%, possibly by a problem-specific algorithm)
open optimal solution to instance is unknown

Classification: A|BC|D where
A is problem type: c (convex) or nc (nonconvex),
B is type of linear variables (i.e. only appearing in linear terms): b (only binary), i (only binary or general integers), c (also continuous), or 0 if none
C is type of nonlinear variables (i.e. appearing in nonlinear terms): b (only binary), i (only binary or general integers), c (also continuous), or 0 if none, and
D is maximum degree of the polynomials.


© by maintainers  |  last update LAST_CHANGE  |  imprint