<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=us-ascii">
<style type="text/css" style="display:none;"> P {margin-top:0;margin-bottom:0;} </style>
</head>
<body dir="ltr">
<div style="font-family: Calibri, Arial, Helvetica, sans-serif; font-size: 12pt; color: rgb(0, 0, 0);">
Hi Marc,</div>
<div style="font-family: Calibri, Arial, Helvetica, sans-serif; font-size: 12pt; color: rgb(0, 0, 0);">
<br>
</div>
<div style="font-family: Calibri, Arial, Helvetica, sans-serif; font-size: 12pt; color: rgb(0, 0, 0);">
Thanks for this. It makes sense that this propagation does not happen automatically. Presolving does not help me since my actual set partitioning constraints are modifiable and most of their variables are added in by pricing.</div>
<div style="font-family: Calibri, Arial, Helvetica, sans-serif; font-size: 12pt; color: rgb(0, 0, 0);">
<br>
</div>
<div style="font-family: Calibri, Arial, Helvetica, sans-serif; font-size: 12pt; color: rgb(0, 0, 0);">
I was able to get the propagations I wanted by adding in some (non-initial, non-separating) "redundant" set partitioning constraints, which works fine.</div>
<div style="font-family: Calibri, Arial, Helvetica, sans-serif; font-size: 12pt; color: rgb(0, 0, 0);">
<br>
</div>
<div style="font-family: Calibri, Arial, Helvetica, sans-serif; font-size: 12pt; color: rgb(0, 0, 0);">
James<br>
</div>
<div>
<div style="font-family: Calibri, Arial, Helvetica, sans-serif; font-size: 12pt; color: rgb(0, 0, 0);">
<br>
</div>
<div id="Signature">
<div>
<div></div>
<div style="font-family:Calibri,Arial,Helvetica,sans-serif; font-size:12pt; color:rgb(0,0,0)">
James Cussens</div>
<div style="font-family:Calibri,Arial,Helvetica,sans-serif; font-size:12pt; color:rgb(0,0,0)">
Dept of Computer Science, University of Bristol</div>
<div style="font-family:Calibri,Arial,Helvetica,sans-serif; font-size:12pt; color:rgb(0,0,0)">
<a href="https://jcussens.github.io/">https://jcussens.github.io/</a></div>
<div style="font-family:Calibri,Arial,Helvetica,sans-serif; font-size:12pt; color:rgb(0,0,0)">
<span style="font-size:11.5pt">Funded PhDs available in Bristol in the following areas: <a href="http://www.bristol.ac.uk/cdt/compass/" target="_blank" rel="noopener noreferrer"><span>Data Science</span></a>, <a href="http://www.bristol.ac.uk/cdt/interactive-ai/" target="_blank" rel="noopener noreferrer"><span>Interactive
AI</span></a>, <a href="http://www.bristol.ac.uk/cdt/cyber-security/" target="_blank" rel="noopener noreferrer"><span>Cyber Security</span></a> or <a href="http://www.bristol.ac.uk/cdt/digital-health/" target="_blank" rel="noopener noreferrer"><span>Digital
Health</span></a>. </span><br>
</div>
</div>
</div>
</div>
<div id="appendonsend"></div>
<hr style="display:inline-block;width:98%" tabindex="-1">
<div id="divRplyFwdMsg" dir="ltr"><font face="Calibri, sans-serif" style="font-size:11pt" color="#000000"><b>From:</b> Scip <scip-bounces@zib.de> on behalf of Marc Pfetsch <pfetsch@mathematik.tu-darmstadt.de><br>
<b>Sent:</b> 28 January 2021 19:03<br>
<b>To:</b> scip@zib.de <scip@zib.de><br>
<b>Subject:</b> Re: [SCIP] propagation with set partitioning constraints</font>
<div> </div>
</div>
<div class="BodyFragment"><font size="2"><span style="font-size:11pt;">
<div class="PlainText"><br>
<br>
Hi James!<br>
<br>
> Suppose I have two set partitioning constraints:<br>
> <br>
> a + b + c + d = 1<br>
> a + b + e = 1<br>
> <br>
> Suppose I were to branch on "e" and let's consider the branch where e=0<br>
> So locally we have a+b=1 and so both c and d can be set to 0 (even<br>
> though we don't know yet which of a or b will be 1).<br>
> <br>
> Does this propagation happen in SCIP? <br>
<br>
I am pretty sure that this will not happen in propagation, because to<br>
test this, would be quite expensive in general. This would be something<br>
that would need to be prepared (or only performed) in preprocessing.<br>
<br>
> From my reading of the source code<br>
> (and Achterberg's thesis) it seems that not. But perhaps I have missed<br>
> something.<br>
<br>
I have looked at the code and have not found a technique like this, not<br>
even in presolving.<br>
<br>
Note, however, that if the constraints would be<br>
<br>
a + b + c = 1<br>
a + b + e = 1<br>
<br>
as far as I can see, SCIP would replace a + b by a new variable binary<br>
variable in preprocessing and then fixing e would also fix c. Thus, your<br>
idea would be possible to implement using this replacement.<br>
<br>
Best<br>
<br>
Marc<br>
_______________________________________________<br>
Scip mailing list<br>
Scip@zib.de<br>
<a href="https://listserv.zib.de/mailman/listinfo/scip">https://listserv.zib.de/mailman/listinfo/scip</a><br>
</div>
</span></font></div>
</body>
</html>