[SCIP] reoptimization issue
James Cussens
james.cussens at york.ac.uk
Wed Jun 21 16:06:54 CEST 2017
I am using reoptimization in SCIP using the following parameter settings:
reoptimization/enable = TRUE
reoptimization/sepabestsol = TRUE
In my code I essentially have the following (after defining the problem):
for( i = 0; i < n; i++ )
{
SCIP_CALL( SCIPsolve(scip) );
SCIP_CALL( SCIPfreeReoptSolve(scip) );
}
When I execute I often get the first few 'best' solutions found but
eventually I always get a crash with the following error message (when
running in DEBUG mode):
src/scip/reopt.c:2384: saveLocalConssData: Assertion
`strcmp(SCIPconshdlrGetName(conshdlr), "bounddisjunction") == 0' failed.
I assume this is due to some deficiency in a constraint handler I have
written. A missing (or perhaps faulty) method perhaps.
An example of this behaviour is attached.
Any clues as to what might be the problem would be appreciated. Running
without reoptimization is fine.
--
James Cussens
Dept of Computer Science &
York Centre for Complex Systems Analysis
Room 326, The Hub, Deramore Lane Tel +44 (0)1904 325371
<+44%201904%20325371>
University of York Fax +44 (0)1904
500159 <+44%201904%20500159>
York YO10 5GE, UK http://www.cs.york.ac.uk/~jc
http://www.york.ac.uk/docs/disclaimer/email.htm
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://listserv.zib.de/pipermail/scip/attachments/20170621/50d68d27/attachment.html>
-------------- next part --------------
james at james-PORTEGE-Z30-A:~/research/gobnilp$ bin/gobnilp data/asia_1000_1_3.scores
GOBNILP version development [GitHash: 9f8daa2 ]
Solving the BN structure learning problem using SCIP.
SCIP version 4.0.0 [precision: 8 byte] [memory: block] [mode: debug] [LP solver: SoPlex 3.0.0] [GitHash: a80a247]
Copyright (C) 2002-2017 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
Reading parameter file <gobnilp.set>.
WARNING: Input file format not recognised - assuming it is Jaakkola.
File name: data/asia_1000_1_3.scores
Problem name: asia_1000_1_3
Number of variables: 8
Number of candidate parent sets: 107
File reading successful
presolving:
(round 1, exhaustive) 0 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 10 upgd conss, 0 impls, 121 clqs
(0.1s) probing cycle finished: starting next cycle
presolving (2 rounds: 2 fast, 2 medium, 2 exhaustive):
0 deleted vars, 0 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0 implications, 877 cliques
presolved problem has 170 variables (170 bin, 0 int, 0 impl, 0 cont) and 125 constraints
2 constraints of type <metadata>
122 constraints of type <setppc>
1 constraints of type <dagcluster>
Presolving Time: 0.09
time | node | left |LP iter| mem |depth|mdpt |frac |cons |cols |rows |cuts |pool |confs|strbr| dualbound | primalbound | gap
k 0.1s| 1 | 0 | 0 |1857k| 7 | 0 | - | 125 | 170 | 122 | 0 | 0 | 0 | 0 | 0.000000e+00 |-2.330362e+03 | Inf
0.1s| 1 | 0 | 83 |1858k| 0 | 0 | 0 | 125 | 170 | 122 | 0 | 0 | 0 | 0 |-2.152028e+03 |-2.330362e+03 | 8.29%
0.3s| 1 | 0 | 110 |1883k| 0 | 0 | 0 | 125 | 170 | 152 | 30 | 1 | 0 | 0 |-2.305263e+03 |-2.330362e+03 | 1.09%
k 0.3s| 1 | 0 | 110 |1883k| 0 | 0 | 0 | 125 | 170 | 152 | 30 | 1 | 0 | 0 |-2.305263e+03 |-2.320696e+03 | 0.67%
0.6s| 1 | 0 | 125 |1883k| 0 | 0 | 32 | 125 | 170 | 154 | 32 | 2 | 0 | 0 |-2.312388e+03 |-2.320696e+03 | 0.36%
k 0.6s| 1 | 0 | 125 |1891k| 0 | 0 | 32 | 125 | 170 | 154 | 32 | 2 | 0 | 0 |-2.312388e+03 |-2.319521e+03 | 0.31%
1.1s| 1 | 0 | 139 |2759k| 0 | 0 | 15 | 125 | 170 | 159 | 37 | 30 | 0 | 0 |-2.316514e+03 |-2.319521e+03 | 0.13%
k 1.1s| 1 | 0 | 139 |2759k| 0 | 0 | 15 | 125 | 170 | 159 | 37 | 30 | 0 | 0 |-2.316514e+03 |-2.317665e+03 | 0.05%
1.1s| 1 | 0 | 144 |2849k| 0 | 0 | 0 | 125 | 170 | 161 | 39 | 42 | 0 | 0 |-2.317412e+03 |-2.317665e+03 | 0.01%
k 1.1s| 1 | 0 | 144 |2849k| 0 | 0 | - | 125 | 170 | 161 | 39 | 42 | 0 | 0 |-2.317412e+03 |-2.317412e+03 | 0.00%
1.1s| 1 | 0 | 144 |2849k| 0 | 0 | - | 125 | 170 | 161 | 39 | 42 | 0 | 0 |-2.317412e+03 |-2.317412e+03 | 0.00%
SCIP Status : problem is solved [optimal solution found]
Solving Time (sec) : 1.13 (over 1 runs: 1.13)
Solving Nodes : 1 (0 reactivated)
Primal Bound : -2.31741150600000e+03 (6 solutions)
Dual Bound : -2.31741150600000e+03
Gap : 0.00 %
0<-1, -678.983132
1<- -213.809238
2<-0, -669.490129
3<- -50.279422
4<-0,3, -49.918575
5<-1,4, -3.817684
6<-5, -211.922016
7<-2,5, -439.191310
BN score is -2317.411506
new objective has similarity of 1 compared to previous.
time | node | left |LP iter| mem |depth|mdpt |frac |cons |cols |rows |cuts |pool |confs|strbr| dualbound | primalbound | gap
J 0.0s| 1 | 0 | 0 |2970k| 0 | 0 | - | 126 | 0 | 0 | 0 | 0 | 0 | 0 | 0.000000e+00 |-2.317665e+03 | Inf
0.0s| 1 | 0 | 74 |2977k| 0 | 0 | 0 | 126 | 170 | 122 | 0 | 1 | 0 | 0 |-2.152028e+03 |-2.317665e+03 | 7.70%
0.0s| 1 | 0 | 83 |2977k| 0 | 0 | 0 | 126 | 170 | 123 | 1 | 1 | 0 | 0 |-2.162744e+03 |-2.317665e+03 | 7.16%
0.3s| 1 | 0 | 118 |2977k| 0 | 0 | 35 | 126 | 170 | 145 | 23 | 2 | 0 | 0 |-2.309419e+03 |-2.317665e+03 | 0.36%
0.5s| 1 | 0 | 123 |3046k| 0 | 0 | 0 | 126 | 170 | 148 | 26 | 31 | 0 | 0 |-2.311024e+03 |-2.317665e+03 | 0.29%
0.8s| 1 | 0 | 134 |3046k| 0 | 0 | 21 | 126 | 170 | 151 | 29 | 32 | 0 | 0 |-2.314921e+03 |-2.317665e+03 | 0.12%
1.0s| 1 | 0 | 145 |3125k| 0 | 0 | 0 | 126 | 170 | 154 | 32 | 39 | 0 | 0 |-2.316880e+03 |-2.317665e+03 | 0.03%
1.0s| 1 | 2 | 145 |3125k| 0 | 0 | 0 | 126 | 170 | 154 | 32 | 39 | 0 | 0 |-2.316880e+03 |-2.317665e+03 | 0.03%
* 1.3s| 20 | 1 | 170 |3131k| 8 | 10 | - | 126 | 170 | 137 | 32 | 39 | 0 | 0 |-2.316880e+03 |-2.317412e+03 | 0.02%
SCIP Status : problem is solved [optimal solution found]
Solving Time (sec) : 1.33 (over 2 runs: 2.47)
Solving Nodes : 21 (0 reactivated)
Primal Bound : -2.31741150600000e+03 (2 solutions)
Dual Bound : -2.31741150600000e+03
Gap : 0.00 %
0<- -696.104926
1<-0, -196.687444
2<-0, -669.490129
3<- -50.279422
4<-0,3, -49.918575
5<-1,4, -3.817684
6<-5, -211.922016
7<-2,5, -439.191310
BN score is -2317.411506
new objective has similarity of 1 compared to previous.
time | node | left |LP iter| mem |depth|mdpt |frac |cons |cols |rows |cuts |pool |confs|strbr| dualbound | primalbound | gap
J 0.0s| 1 | 0 | 0 |3131k| 0 | 0 | - | 127 | 0 | 0 | 0 | 0 | 0 | 0 | 0.000000e+00 |-2.317665e+03 | Inf
0.0s| 1 | 10 | 0 |3132k| 0 | 0 | - | 127 | 0 | 0 | 0 | 0 | 0 | 0 | 0.000000e+00 |-2.317665e+03 | Inf
gobnilp: src/scip/reopt.c:2384: saveLocalConssData: Assertion `strcmp(SCIPconshdlrGetName(conshdlr), "bounddisjunction") == 0' failed.
Aborted (core dumped)
More information about the Scip
mailing list