POLIPlibrary for polynomially constrained
| ||
Displaying instances of type maxcut.
Filter by type:status | name | type | classification | vars | nonlin vars |
lin cons |
nonlin cons |
lin nonzeros |
nonlin nonzeros |
sense | best primal | best dual |
ising2.5-100_5555 | maxcut | nc|bc|d2 | 101 | 101 | 0 | 1 | 0 | 4982 | max | 2460049 | 2460049 | |
ising2.5-150_5555 | maxcut | nc|bc|d2 | 151 | 151 | 0 | 1 | 0 | 10862 | max | 4363532 | 4363532 | |
ising3.0-100_5555 | maxcut | nc|bc|d2 | 101 | 101 | 0 | 1 | 0 | 4676 | max | 2448189 | 2448189 | |
ising3.0-150_5555 | maxcut | nc|bc|d2 | 151 | 151 | 0 | 1 | 0 | 8541 | max | 4279261 | 4279261 | |
sched-10-4711 | maxcut | nc|bc|d2 | 46 | 1 | 0 | 1 | 0 | 113 | max | 44 | 44 | |
sched-12-4711 | maxcut | nc|bc|d2 | 67 | 1 | 0 | 1 | 0 | 167 | max | 68 | 68 | |
sched-14-4711 | maxcut | nc|bc|d2 | 92 | 1 | 0 | 1 | 0 | 236 | max | 96 | 96 | |
sched-16-4711 | maxcut | nc|bc|d2 | 121 | 1 | 0 | 1 | 0 | 313 | max | 130 | 130 | |
sched-18-4711 | maxcut | nc|bc|d2 | 154 | 1 | 0 | 1 | 0 | 390 | max | 160 | 160 | |
status | name | type | classification | vars | nonlin vars |
lin cons |
nonlin cons |
lin nonzeros |
nonlin nonzeros |
sense | best primal | best dual |
sched-20-4711 | maxcut | nc|bc|d2 | 191 | 1 | 0 | 1 | 0 | 488 | max | 192 | 192 | |
sched-22-4711 | maxcut | nc|bc|d2 | 232 | 1 | 0 | 1 | 0 | 603 | max | 234 | 234 | |
sched-24-4711 | maxcut | nc|bc|d2 | 277 | 1 | 0 | 1 | 0 | 711 | max | 282 | 282 | |
sched-26-4711 | maxcut | nc|bc|d2 | 326 | 1 | 0 | 1 | 0 | 853 | max | 334 | 334 | |
sched-28-4711 | maxcut | nc|bc|d2 | 379 | 1 | 0 | 1 | 0 | 973 | max | |||
sched-30-4711 | maxcut | nc|bc|d2 | 436 | 1 | 0 | 1 | 0 | 1115 | max | |||
sched-32-4711 | maxcut | nc|bc|d2 | 497 | 1 | 0 | 1 | 0 | 1287 | max | |||
sched-34-4711 | maxcut | nc|bc|d2 | 562 | 1 | 0 | 1 | 0 | 1442 | max | |||
sched-36-4711 | maxcut | nc|bc|d2 | 631 | 1 | 0 | 1 | 0 | 1609 | max | |||
status | name | type | classification | vars | nonlin vars |
lin cons |
nonlin cons |
lin nonzeros |
nonlin nonzeros |
sense | best primal | best dual |
sched-38-4711 | maxcut | nc|bc|d2 | 704 | 1 | 0 | 1 | 0 | 1803 | max | |||
sched-40-4711 | maxcut | nc|bc|d2 | 781 | 1 | 0 | 1 | 0 | 1997 | max | |||
sched-42-4711 | maxcut | nc|bc|d2 | 862 | 1 | 0 | 1 | 0 | 2208 | max | |||
sched-44-4711 | maxcut | nc|bc|d2 | 947 | 1 | 0 | 1 | 0 | 2450 | max | |||
sched-46-4711 | maxcut | nc|bc|d2 | 1036 | 1 | 0 | 1 | 0 | 2665 | max | |||
sched-48-4711 | maxcut | nc|bc|d2 | 1129 | 1 | 0 | 1 | 0 | 2956 | max | |||
sched-50-4711 | maxcut | nc|bc|d2 | 1226 | 1 | 0 | 1 | 0 | 3131 | max | |||
sched-6-4711 | maxcut | nc|bc|d2 | 16 | 1 | 0 | 1 | 0 | 36 | max | 12 | 12 | |
sched-8-4711 | maxcut | nc|bc|d2 | 29 | 1 | 0 | 1 | 0 | 64 | max | 24 | 24 | |
status | name | type | classification | vars | nonlin vars |
lin cons |
nonlin cons |
lin nonzeros |
nonlin nonzeros |
sense | best primal | best dual |
t2g10_5555 | maxcut | nc|bc|d2 | 101 | 101 | 0 | 1 | 0 | 301 | max | 6049461 | 6049461 | |
t2g15_5555 | maxcut | nc|bc|d2 | 226 | 226 | 0 | 1 | 0 | 676 | max | 15051133 | 15051133 | |
t2g20_5555 | maxcut | nc|bc|d2 | 401 | 401 | 0 | 1 | 0 | 1201 | max | 24838942 | 24838942 | |
t3g5_5555 | maxcut | nc|bc|d2 | 126 | 126 | 0 | 1 | 0 | 501 | max | 10933215 | 10933215 | |
t3g6_5555 | maxcut | nc|bc|d2 | 217 | 217 | 0 | 1 | 0 | 865 | max | 17434469 | 17434469 | |
t3g7_5555 | maxcut | nc|bc|d2 | 344 | 344 | 0 | 1 | 0 | 1373 | max | 28302918 | 28302918 |
Status:
instance can be solved within an hour with a general-purpose solver
(to a final gap of at least 0.1%)
instance has been solved (to a final gap of at least 0.1%, possibly by a problem-specific algorithm)
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