MINLPLib
A Library of Mixed-Integer and Continuous Nonlinear Programming Instances
Home // Instances // Documentation // Download // Statistics
Instance graphpart_3g-0234-0234
This is a quadratic model for the graph partitioning problem. The graphs are taken from the publication of Ghaddar et al. We used 3 parts of the partition to generate the quadratic instances. The model assigns each node to one of the three parts. Hence, the model is symmetric, which should probably be used in a solution algorithm.
| Formatsⓘ | ams gms lp mod nl osil pip py |
| Primal Bounds (infeas ≤ 1e-08)ⓘ | |
| Other points (infeas > 1e-08)ⓘ | |
| Dual Boundsⓘ | -1952753.00200000 (ANTIGONE) -1952753.00000000 (BARON) -1952753.00000000 (COUENNE) -1952753.00000000 (CPLEX) -1952753.00000000 (GUROBI) -1952753.00000000 (LINDO) -1952753.00000000 (SCIP) -1952753.00000000 (SHOT) |
| Referencesⓘ | Ghaddar, Bissan, Anjos, Miguel F, and Liers, Frauke, A Branch-and-Cut Algorithm based on Semidefinite Programming for the Minimum k-Partition Problem, Annals of Operations Research, 188:1, 2011, 155-174. |
| Sourceⓘ | POLIP instance graphpart/data_3g_234_234.dimacs |
| Applicationⓘ | Graph Partitioning |
| Added to libraryⓘ | 26 Feb 2014 |
| Problem typeⓘ | BQP |
| #Variablesⓘ | 72 |
| #Binary Variablesⓘ | 72 |
| #Integer Variablesⓘ | 0 |
| #Nonlinear Variablesⓘ | 72 |
| #Nonlinear Binary Variablesⓘ | 72 |
| #Nonlinear Integer Variablesⓘ | 0 |
| Objective Senseⓘ | min |
| Objective typeⓘ | quadratic |
| Objective curvatureⓘ | indefinite |
| #Nonzeros in Objectiveⓘ | 72 |
| #Nonlinear Nonzeros in Objectiveⓘ | 72 |
| #Constraintsⓘ | 24 |
| #Linear Constraintsⓘ | 24 |
| #Quadratic Constraintsⓘ | 0 |
| #Polynomial Constraintsⓘ | 0 |
| #Signomial Constraintsⓘ | 0 |
| #General Nonlinear Constraintsⓘ | 0 |
| Operands in Gen. Nonlin. Functionsⓘ | |
| Constraints curvatureⓘ | linear |
| #Nonzeros in Jacobianⓘ | 72 |
| #Nonlinear Nonzeros in Jacobianⓘ | 0 |
| #Nonzeros in (Upper-Left) Hessian of Lagrangianⓘ | 360 |
| #Nonzeros in Diagonal of Hessian of Lagrangianⓘ | 0 |
| #Blocks in Hessian of Lagrangianⓘ | 3 |
| Minimal blocksize in Hessian of Lagrangianⓘ | 24 |
| Maximal blocksize in Hessian of Lagrangianⓘ | 24 |
| Average blocksize in Hessian of Lagrangianⓘ | 24.0 |
| #Semicontinuitiesⓘ | 0 |
| #Nonlinear Semicontinuitiesⓘ | 0 |
| #SOS type 1ⓘ | 0 |
| #SOS type 2ⓘ | 0 |
| Minimal coefficientⓘ | 1.0000e+00 |
| Maximal coefficientⓘ | 3.1363e+05 |
| Infeasibility of initial pointⓘ | 1 |
| Sparsity Jacobianⓘ |  |
| Sparsity Hessian of Lagrangianⓘ |  |
$offlisting
*
* Equation counts
* Total E G L N X C B
* 25 25 0 0 0 0 0 0
*
* Variable counts
* x b i s1s s2s sc si
* Total cont binary integer sos1 sos2 scont sint
* 73 1 72 0 0 0 0 0
* FX 0
*
* Nonzero counts
* Total const NL DLL
* 145 73 72 0
*
* Solve m using MINLP minimizing objvar;
Variables b1,b2,b3,b4,b5,b6,b7,b8,b9,b10,b11,b12,b13,b14,b15,b16,b17,b18,b19
,b20,b21,b22,b23,b24,b25,b26,b27,b28,b29,b30,b31,b32,b33,b34,b35,b36
,b37,b38,b39,b40,b41,b42,b43,b44,b45,b46,b47,b48,b49,b50,b51,b52,b53
,b54,b55,b56,b57,b58,b59,b60,b61,b62,b63,b64,b65,b66,b67,b68,b69,b70
,b71,b72,objvar;
Binary Variables b1,b2,b3,b4,b5,b6,b7,b8,b9,b10,b11,b12,b13,b14,b15,b16,b17
,b18,b19,b20,b21,b22,b23,b24,b25,b26,b27,b28,b29,b30,b31,b32,b33,b34
,b35,b36,b37,b38,b39,b40,b41,b42,b43,b44,b45,b46,b47,b48,b49,b50,b51
,b52,b53,b54,b55,b56,b57,b58,b59,b60,b61,b62,b63,b64,b65,b66,b67,b68
,b69,b70,b71,b72;
Equations e1,e2,e3,e4,e5,e6,e7,e8,e9,e10,e11,e12,e13,e14,e15,e16,e17,e18,e19
,e20,e21,e22,e23,e24,e25;
e1.. b1 + b2 + b3 =E= 1;
e2.. b4 + b5 + b6 =E= 1;
e3.. b7 + b8 + b9 =E= 1;
e4.. b10 + b11 + b12 =E= 1;
e5.. b13 + b14 + b15 =E= 1;
e6.. b16 + b17 + b18 =E= 1;
e7.. b19 + b20 + b21 =E= 1;
e8.. b22 + b23 + b24 =E= 1;
e9.. b25 + b26 + b27 =E= 1;
e10.. b28 + b29 + b30 =E= 1;
e11.. b31 + b32 + b33 =E= 1;
e12.. b34 + b35 + b36 =E= 1;
e13.. b37 + b38 + b39 =E= 1;
e14.. b40 + b41 + b42 =E= 1;
e15.. b43 + b44 + b45 =E= 1;
e16.. b46 + b47 + b48 =E= 1;
e17.. b49 + b50 + b51 =E= 1;
e18.. b52 + b53 + b54 =E= 1;
e19.. b55 + b56 + b57 =E= 1;
e20.. b58 + b59 + b60 =E= 1;
e21.. b61 + b62 + b63 =E= 1;
e22.. b64 + b65 + b66 =E= 1;
e23.. b67 + b68 + b69 =E= 1;
e24.. b70 + b71 + b72 =E= 1;
e25.. 36391*b1*b4 - 56023*b1*b7 - 30587*b1*b10 + 43940*b1*b19 + 103654*b1*b55
+ 36391*b2*b5 - 56023*b2*b8 - 30587*b2*b11 + 43940*b2*b20 + 103654*b2*
b56 + 36391*b3*b6 - 56023*b3*b9 - 30587*b3*b12 + 43940*b3*b21 + 103654*b3
*b57 - 42004*b4*b7 - 64233*b4*b13 + 75921*b4*b22 + 137016*b4*b58 - 42004*
b5*b8 - 64233*b5*b14 + 75921*b5*b23 + 137016*b5*b59 - 42004*b6*b9 - 64233
*b6*b15 + 75921*b6*b24 + 137016*b6*b60 + 140585*b7*b16 + 145261*b7*b25 +
13442*b7*b61 + 140585*b8*b17 + 145261*b8*b26 + 13442*b8*b62 + 140585*b9*
b18 + 145261*b9*b27 + 13442*b9*b63 - 67931*b10*b13 + 216581*b10*b16 +
52450*b10*b28 - 12680*b10*b64 - 67931*b11*b14 + 216581*b11*b17 + 52450*
b11*b29 - 12680*b11*b65 - 67931*b12*b15 + 216581*b12*b18 + 52450*b12*b30
- 12680*b12*b66 - 40867*b13*b16 + 53965*b13*b31 + 127982*b13*b67 - 40867
*b14*b17 + 53965*b14*b32 + 127982*b14*b68 - 40867*b15*b18 + 53965*b15*b33
+ 127982*b15*b69 + 8603*b16*b34 + 161176*b16*b70 + 8603*b17*b35 + 161176
*b17*b71 + 8603*b18*b36 + 161176*b18*b72 - 30437*b19*b22 + 49122*b19*b25
+ 43433*b19*b28 - 16626*b19*b37 - 30437*b20*b23 + 49122*b20*b26 + 43433*
b20*b29 - 16626*b20*b38 - 30437*b21*b24 + 49122*b21*b27 + 43433*b21*b30
- 16626*b21*b39 - 145961*b22*b25 - 15003*b22*b31 + 129731*b22*b40 -
145961*b23*b26 - 15003*b23*b32 + 129731*b23*b41 - 145961*b24*b27 - 15003*
b24*b33 + 129731*b24*b42 - 183464*b25*b34 - 186557*b25*b43 - 183464*b26*
b35 - 186557*b26*b44 - 183464*b27*b36 - 186557*b27*b45 + 29786*b28*b31 -
313633*b28*b34 - 39968*b28*b46 + 29786*b29*b32 - 313633*b29*b35 - 39968*
b29*b47 + 29786*b30*b33 - 313633*b30*b36 - 39968*b30*b48 + 91033*b31*b34
- 84205*b31*b49 + 91033*b32*b35 - 84205*b32*b50 + 91033*b33*b36 - 84205*
b33*b51 - 41917*b34*b52 - 41917*b35*b53 - 41917*b36*b54 - 53775*b37*b40
- 94936*b37*b43 + 17605*b37*b46 + 103658*b37*b55 - 53775*b38*b41 - 94936
*b38*b44 + 17605*b38*b47 + 103658*b38*b56 - 53775*b39*b42 - 94936*b39*b45
+ 17605*b39*b48 + 103658*b39*b57 + 73358*b40*b43 + 51387*b40*b49 -
101209*b40*b58 + 73358*b41*b44 + 51387*b41*b50 - 101209*b41*b59 + 73358*
b42*b45 + 51387*b42*b51 - 101209*b42*b60 + 77521*b43*b52 + 108709*b43*b61
+ 77521*b44*b53 + 108709*b44*b62 + 77521*b45*b54 + 108709*b45*b63 -
97439*b46*b49 - 217980*b46*b52 + 163226*b46*b64 - 97439*b47*b50 - 217980*
b47*b53 + 163226*b47*b65 - 97439*b48*b51 - 217980*b48*b54 + 163226*b48*
b66 + 5548*b49*b52 - 93151*b49*b67 + 5548*b50*b53 - 93151*b50*b68 + 5548*
b51*b54 - 93151*b51*b69 + 208299*b52*b70 + 208299*b53*b71 + 208299*b54*
b72 + 16385*b55*b58 + 6737*b55*b61 - 94240*b55*b64 + 16385*b56*b59 + 6737
*b56*b62 - 94240*b56*b65 + 16385*b57*b60 + 6737*b57*b63 - 94240*b57*b66
- 51575*b58*b61 - 158490*b58*b67 - 51575*b59*b62 - 158490*b59*b68 -
51575*b60*b63 - 158490*b60*b69 - 26327*b61*b70 - 26327*b62*b71 - 26327*
b63*b72 + 136319*b64*b67 + 56292*b64*b70 + 136319*b65*b68 + 56292*b65*b71
+ 136319*b66*b69 + 56292*b66*b72 - 47852*b67*b70 - 47852*b68*b71 - 47852
*b69*b72 - objvar =E= 0;
Model m / all /;
m.limrow=0; m.limcol=0;
m.tolproj=0.0;
$if NOT '%gams.u1%' == '' $include '%gams.u1%'
$if not set MINLP $set MINLP MINLP
Solve m using %MINLP% minimizing objvar;
Last updated: 2024-12-17 Git hash: 8eaceb91