<html>
<head>
<meta http-equiv="content-type" content="text/html; charset=ISO-8859-1">
</head>
<body bgcolor="#FFFFFF" text="#000000">
Hi,<br>
<br>
I have a few questions on the theoretical part of SCIP. I skimmed
over Dr<em>.Achterberg</em><em style="color: rgb(51, 51, 51);
font-family: Verdana, Arial, Helvetica, sans-serif; font-size:
11px; font-variant: normal; font-weight: normal; letter-spacing:
normal; line-height: 15.680000305175781px; orphans: auto;
text-align: left; text-indent: 0px; text-transform: none;
white-space: normal; widows: auto; word-spacing: 0px;
-webkit-text-stroke-width: 0px; background-color: rgb(255, 255,
255);"></em>'s dissertation. Unfortunately, theory is not my field
of research, so I was completely lost when I read it. I hope
somebody on this list can help with these questions. Here are my
questions:<br>
<br>
First, what is the theoretical complexity of SCIP when solving an
integer programming problem? <br>
<br>
Second, how is the approach used by SCIP compared to Lenstra's
algorithm and its variants? Is SCIP's algorithm performs better than
them? Additionally, is SCIP related to Lenstra's algorithm? It seems
to me they are related, but Lenstra's paper was not referenced in
the dissertation. <br>
<br>
Third, is that possible to speed up SCIP with multi-threading? Or,
can SCIP's algorithm be partitioned into concurrent parts?<br>
<br>
Thank you,<br>
Wei<br>
<br>
</body>
</html>