Sparsity pattern

go19

Namego19
Downloadgo19.mps.gz
Solutiongo19.sol.gz
Set Membership Challenge Tree
Problem StatusEasy
Problem FeasibilityFeasible
Originator/ContributorR. Miyashiro, Y. Yano, M. Muramatsu
Rows441
Cols441
Num. non-zeros in A1885
Num. non-zeros in c361
Rows/Cols1.0
Integers
Binaries441
Continuous
min nonzero |Aij|1
max |Aij|1
min nonzero |cj|1
max |cj|1
Integer Objective84
LP Objective76.530222
Aggregation
Variable Bound
Set partitioning
Set packing
Set covering361
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack361
Knapsacks
Integer Knapsack
Mixed 0/1
General Cons.
References MiyashiroYanoMuramatsu2007

Instance of the maximum string problem in the Go board game: to find a position of stones that maximizes the number of live ``strings" on the board


Last Update December 6, 2016 by Gerald Gamrath
© 2016 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)
Imprint