| Name | PseudoBoolean/PseudoBoolean-opt-routing/ Pb-routing-s3-3-3-1.xml |
| MD5SUM | d246e7ee644c503b58cd0ccaee57aa1d |
| Bench Category | COP (optimization problem) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 36 |
| Best CPU time to get the best result obtained on this benchmark | 0.34218401 |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Number of variables | 216 |
| Number of constraints | 584 |
| Number of domains | 1 |
| Minimum domain size | 2 |
| Maximum domain size | 2 |
| Distribution of domain sizes | [{"size":2,"count":216}] |
| Minimum variable degree | 7 |
| Maximum variable degree | 13 |
| Distribution of variable degrees | [{"degree":7,"count":28},{"degree":8,"count":116},{"degree":9,"count":2},{"degree":10,"count":14},{"degree":12,"count":12},{"degree":13,"count":44}] |
| Minimum constraint arity | 2 |
| Maximum constraint arity | 18 |
| Distribution of constraint arities | [{"arity":2,"count":210},{"arity":3,"count":302},{"arity":4,"count":60},{"arity":18,"count":12}] |
| Number of extensional constraints | 0 |
| Number of intensional constraints | 0 |
| Distribution of constraint types | [{"type":"sum","count":584}] |
| Optimization problem | YES |
| Type of objective | min SUM |
| Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
|---|---|---|---|---|---|
| cosoco-mini 1.1 (2017-07-29) (complete) | 4259979 | OPT | 36 | 0.34218401 | 0.44580999 |
| cosoco-mini 1.12 (complete) | 4267160 | OPT | 36 | 0.34393999 | 0.34490499 |
| cosoco-mini 1.1 (2017-06-27) (complete) | 4253386 | OPT | 36 | 0.355418 | 0.356766 |
| Naxos 1.1.0 (complete) | 4253387 | OPT | 36 | 18.8309 | 18.8318 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 36<instantiation type='solution' cost='-36'> <list>x[0] x[100] x[101] x[102] x[103] x[104] x[105] x[106] x[107] x[108] x[109] x[10] x[110] x[111] x[112] x[113] x[114] x[115] x[116] x[117] x[118] x[119] x[11] x[120] x[121] x[122] x[123] x[124] x[125] x[126] x[127] x[128] x[129] x[12] x[130] x[131] x[132] x[133] x[134] x[135] x[136] x[137] x[138] x[139] x[13] x[140] x[141] x[142] x[143] x[144] x[145] x[146] x[147] x[148] x[149] x[14] x[150] x[151] x[152] x[153] x[154] x[155] x[156] x[157] x[158] x[159] x[15] x[160] x[161] x[162] x[163] x[164] x[165] x[166] x[167] x[168] x[169] x[16] x[170] x[171] x[172] x[173] x[174] x[175] x[176] x[177] x[178] x[179] x[17] x[180] x[181] x[182] x[183] x[184] x[185] x[186] x[187] x[188] x[189] x[18] x[190] x[191] x[192] x[193] x[194] x[195] x[196] x[197] x[198] x[199] x[19] x[1] x[200] x[201] x[202] x[203] x[204] x[205] x[206] x[207] x[208] x[209] x[20] x[210] x[211] x[212] x[213] x[214] x[215] x[21] x[22] x[23] x[24] x[25] x[26] x[27] x[28] x[29] x[2] x[30] x[31] x[32] x[33] x[34] x[35] x[36] x[37] x[38] x[39] x[3] x[40] x[41] x[42] x[43] x[44] x[45] x[46] x[47] x[48] x[49] x[4] x[50] x[51] x[52] x[53] x[54] x[55] x[56] x[57] x[58] x[59] x[5] x[60] x[61] x[62] x[63] x[64] x[65] x[66] x[67] x[68] x[69] x[6] x[70] x[71] x[72] x[73] x[74] x[75] x[76] x[77] x[78] x[79] x[7] x[80] x[81] x[82] x[83] x[84] x[85] x[86] x[87] x[88] x[89] x[8] x[90] x[91] x[92] x[93] x[94] x[95] x[96] x[97] x[98] x[99] x[9] </list> <values>1 1 1 0 0 0 1 0 0 0 1 1 1 0 0 0 0 1 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 0 0 0 1 1 1 0 0 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 1 0 0 0 0 1 0 0 0 1 1 0 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 </values> </instantiation>