MINLPLib

A Library of Mixed-Integer and Continuous Nonlinear Programming Instances

Home // Instances // Documentation // Download // Statistics


Instance: graphpart_2pm-0044-0044

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
Primal Bounds
-13.00000000 p1 ( gdx sol )
(infeas: 0)
Dual Bounds
-13.00000001 (ANTIGONE)
-13.00000000 (BARON)
-13.00000000 (COUENNE)
-13.00000000 (LINDO)
-13.00000000 (SCIP)
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_2pm_44_44.dimacs
Application Graph Partitioning
Added to library 26 Feb 2014
Problem type BQP
#Variables 48
#Binary Variables 48
#Integer Variables 0
#Nonlinear Variables 48
#Nonlinear Binary Variables 48
#Nonlinear Integer Variables 0
Objective Sense min
Objective type quadratic
Objective curvature indefinite
#Nonzeros in Objective 48
#Nonlinear Nonzeros in Objective 48
#Constraints 16
#Linear Constraints 16
#Quadratic Constraints 0
#Polynomial Constraints 0
#Signomial Constraints 0
#General Nonlinear Constraints 0
Operands in Gen. Nonlin. Functions  
Constraints curvature linear
#Nonzeros in Jacobian 48
#Nonlinear Nonzeros in Jacobian 0
#Nonzeros in (Upper-Left) Hessian of Lagrangian 192
#Nonzeros in Diagonal of Hessian of Lagrangian 0
#Blocks in Hessian of Lagrangian 3
Minimal blocksize in Hessian of Lagrangian 16
Maximal blocksize in Hessian of Lagrangian 16
Average blocksize in Hessian of Lagrangian 16.0
#Semicontinuities 0
#Nonlinear Semicontinuities 0
#SOS type 1 0
#SOS type 2 0
Infeasibility of initial point 1
Sparsity Jacobian Sparsity of Objective Gradient and Jacobian
Sparsity Hessian of Lagrangian Sparsity of Hessian of Lagrangian

$offlisting
*  
*  Equation counts
*      Total        E        G        L        N        X        C        B
*         17       17        0        0        0        0        0        0
*  
*  Variable counts
*                   x        b        i      s1s      s2s       sc       si
*      Total     cont   binary  integer     sos1     sos2    scont     sint
*         49        1       48        0        0        0        0        0
*  FX      0
*  
*  Nonzero counts
*      Total    const       NL      DLL
*         97       49       48        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,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;

Equations  e1,e2,e3,e4,e5,e6,e7,e8,e9,e10,e11,e12,e13,e14,e15,e16,e17;


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.. (-b1*b4) - b1*b10 + b1*b13 + b1*b37 - b2*b5 - b2*b11 + b2*b14 + b2*b38 - 
      b3*b6 - b3*b12 + b3*b15 + b3*b39 + b4*b7 + b4*b16 - b4*b40 + b5*b8 + b5*
      b17 - b5*b41 + b6*b9 + b6*b18 - b6*b42 - b7*b10 + b7*b19 + b7*b43 - b8*
      b11 + b8*b20 + b8*b44 - b9*b12 + b9*b21 + b9*b45 - b10*b22 + b10*b46 - 
      b11*b23 + b11*b47 - b12*b24 + b12*b48 - b13*b16 + b13*b22 - b13*b25 - b14
      *b17 + b14*b23 - b14*b26 - b15*b18 + b15*b24 - b15*b27 - b16*b19 + b16*
      b28 - b17*b20 + b17*b29 - b18*b21 + b18*b30 + b19*b22 - b19*b31 + b20*b23
       - b20*b32 + b21*b24 - b21*b33 - b22*b34 - b23*b35 - b24*b36 + b25*b28 + 
      b25*b34 - b25*b37 + b26*b29 + b26*b35 - b26*b38 + b27*b30 + b27*b36 - b27
      *b39 + b28*b31 + b28*b40 + b29*b32 + b29*b41 + b30*b33 + b30*b42 - b31*
      b34 - b31*b43 - b32*b35 - b32*b44 - b33*b36 - b33*b45 - b34*b46 - b35*b47
       - b36*b48 + b37*b40 - b37*b46 + b38*b41 - b38*b47 + b39*b42 - b39*b48 - 
      b40*b43 - b41*b44 - b42*b45 + b43*b46 + b44*b47 + b45*b48 - 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: 2018-09-14 Git hash: ac5a5314
Imprint / Privacy Policy