<div dir="ltr">Hi John,<div><br></div><div>Thanks for the reply. If interested - the code is here: <a href="https://github.com/mgalati13/kaggle/tree/master/Santa2017">https://github.com/mgalati13/kaggle/tree/master/Santa2017</a></div><div><br></div><div>I don't think the data for the Round 1 competition is available online any longer. If you plan to look at it, let me know and I'll put it somewhere you can grab.</div><div><br></div><div>Cheers,</div><div>Matt</div></div><div class="gmail_extra"><br><div class="gmail_quote">On Mon, Jan 29, 2018 at 9:58 AM, John Forrest <span dir="ltr"><<a href="mailto:john.forrest@fastercoin.com" target="_blank">john.forrest@fastercoin.com</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">
  
    
  
  <div text="#000000" bgcolor="#FFFFFF">
    <div class="m_155843117424373991moz-cite-prefix">Matt,<br>
      <br>
      Fixed 2. (now says Lower or Upper)<br>
      <br>
      Not doing 1. for now - most likely probing in preprocessing -
      obviously you can switch off preprocessing.<br>
      <br>
      A less minor issue is that you want to solve this problem.  I
      would guess that there are 998,000 convexity rows for SOS - which
      is good for modeling but obviously not so good for the LP.  If
      they are convexity rows then it may be possible to take them out
      and add them back as cuts.<br>
      <br>
      If you want, I can look at (a slightly smaller) problem to see
      what can be done.<span class="HOEnZb"><font color="#888888"><br>
      <br>
      John</font></span><div><div class="h5"><br>
      <br>
      On 23/01/18 02:06, Matthew Galati wrote:<br>
    </div></div></div>
    <blockquote type="cite"><div><div class="h5">
      
      
      
      <div class="m_155843117424373991WordSection1">
        <p class="MsoNormal">Two minor issues. This is through the C++
          CBCModel API using the latest CBC.<u></u><u></u></p>
        <p class="MsoNormal"><u></u> <u></u></p>
        <ol style="margin-top:0in" start="1" type="1">
          <li class="m_155843117424373991MsoListParagraph" style="margin-left:0in">I set max
            time (1300 seconds), but CBC did not stop until after 19,900
            seconds.<u></u><u></u></li>
          <li class="m_155843117424373991MsoListParagraph" style="margin-left:0in">This is a
            maximization problem, but the final summary states “Lower
            bound” for the bound. It might be cleaner to just say
            “bound” – to avoid confusion.<u></u><u></u></li>
        </ol>
        <p class="MsoNormal"><u></u> <u></u></p>
        <p class="MsoNormal">command line - cbc -solve -quit -seconds
          1300 (default strategy 1)<u></u><u></u></p>
        <p class="MsoNormal">Continuous objective value is 1.88508e+09 -
          855.75 seconds<u></u><u></u></p>
        <p class="MsoNormal">Cgl0005I 998000 SOS with 13941976 members<u></u><u></u></p>
        <p class="MsoNormal">Cgl0004I processed model has 999000 rows,
          13941976 columns (13941976 integer
(13                           <wbr>                              <wbr>             
                                    <wbr>941976 of which binary)) and
          26887952 elements<u></u><u></u></p>
        <p class="MsoNormal">Cutoff increment increased from 1e-05 to
          0.9999<u></u><u></u></p>
        <p class="MsoNormal">Cbc0020I Exiting on maximum time<u></u><u></u></p>
        <p class="MsoNormal">Cbc0005I Partial search - best objective
          1e+50 (best possible -1.885078e+09), to                     
                              <wbr>                              <wbr>               ok
          0 iterations and 0 nodes (19624.31 seconds)<u></u><u></u></p>
        <p class="MsoNormal">Cbc0035I Maximum depth 0, 0 variables fixed
          on reduced cost<u></u><u></u></p>
        <p class="MsoNormal">Cuts at root node changed objective from
          -1.88508e+09 to -1.88508e+09<u></u><u></u></p>
        <p class="MsoNormal">Probing was tried 0 times and created 0
          cuts of which 0 were active after
adding                        <wbr>                              <wbr>                              <wbr>             
          rounds of cuts (0.000 seconds)<u></u><u></u></p>
        <p class="MsoNormal">Gomory was tried 0 times and created 0 cuts
          of which 0 were active after
adding                        <wbr>                              <wbr>                              <wbr>             
          rounds of cuts (0.000 seconds)<u></u><u></u></p>
        <p class="MsoNormal">Knapsack was tried 0 times and created 0
          cuts of which 0 were active after addin                  
                              <wbr>                              <wbr>                  g
          rounds of cuts (0.000 seconds)<u></u><u></u></p>
        <p class="MsoNormal">Clique was tried 0 times and created 0 cuts
          of which 0 were active after
          adding                        <wbr>                              <wbr>           
                                        <wbr>  rounds of cuts (0.000 seconds)<u></u><u></u></p>
        <p class="MsoNormal">MixedIntegerRounding2 was tried 0 times and
          created 0 cuts of which 0 were
activ                         <wbr>                              <wbr>                              <wbr>           
          e after adding rounds of cuts (0.000 seconds)<u></u><u></u></p>
        <p class="MsoNormal">FlowCover was tried 0 times and created 0
          cuts of which 0 were active after
addi                          <wbr>                              <wbr>                              <wbr>          
          ng rounds of cuts (0.000 seconds)<u></u><u></u></p>
        <p class="MsoNormal">TwoMirCuts was tried 0 times and created 0
          cuts of which 0 were active after
add                           <wbr>                              <wbr>                              <wbr>         
          ing rounds of cuts (0.000 seconds)<u></u><u></u></p>
        <p class="MsoNormal"><u></u> <u></u></p>
        <p class="MsoNormal">Result - Stopped on time limit<u></u><u></u></p>
        <p class="MsoNormal"><u></u> <u></u></p>
        <p class="MsoNormal">No feasible solution found<u></u><u></u></p>
        <p class="MsoNormal">Lower bound:                   
          1885078031.000<u></u><u></u></p>
        <p class="MsoNormal">Enumerated nodes:               0<u></u><u></u></p>
        <p class="MsoNormal">Total iterations:               0<u></u><u></u></p>
        <p class="MsoNormal">Time (CPU seconds):             19928.34<u></u><u></u></p>
        <p class="MsoNormal">Time (Wallclock seconds):       19973.07<u></u><u></u></p>
        <p class="MsoNormal"><u></u> <u></u></p>
        <p class="MsoNormal">Total time (CPU seconds):       19930.87  
          (Wallclock seconds):       19975.64<u></u><u></u></p>
      </div>
      <br>
      <fieldset class="m_155843117424373991mimeAttachmentHeader"></fieldset>
      <br>
      </div></div><span class=""><pre>______________________________<wbr>_________________
Cbc mailing list
<a class="m_155843117424373991moz-txt-link-abbreviated" href="mailto:Cbc@list.coin-or.org" target="_blank">Cbc@list.coin-or.org</a>
<a class="m_155843117424373991moz-txt-link-freetext" href="https://urldefense.proofpoint.com/v2/url?u=https-3A__list.coin-2Dor.org_mailman_listinfo_cbc&d=DwMD-g&c=Ngd-ta5yRYsqeUsEDgxhcqsYYY1Xs5ogLxWPA_2Wlc4&r=Vr27lhfGqB7S9o4_CImgCU72HsP0kI1KcepC3i9tKp4&m=LiDqRMpEzUn66neuP0IW6HFI9WfnwTsFxMbLR5aEVFE&s=4tRqRiU5wSrkNbiYeEabKEn1m8KSTBRFMiAvn7qUBrI&e=" target="_blank">https://list.coin-or.org/<wbr>mailman/listinfo/cbc</a>
</pre>
    </span></blockquote>
    <p><br>
    </p>
  </div>

<br>______________________________<wbr>_________________<br>
Cbc mailing list<br>
<a href="mailto:Cbc@list.coin-or.org">Cbc@list.coin-or.org</a><br>
<a href="https://urldefense.proofpoint.com/v2/url?u=https-3A__list.coin-2Dor.org_mailman_listinfo_cbc&d=DwICAg&c=Ngd-ta5yRYsqeUsEDgxhcqsYYY1Xs5ogLxWPA_2Wlc4&r=Vr27lhfGqB7S9o4_CImgCU72HsP0kI1KcepC3i9tKp4&m=LiDqRMpEzUn66neuP0IW6HFI9WfnwTsFxMbLR5aEVFE&s=4tRqRiU5wSrkNbiYeEabKEn1m8KSTBRFMiAvn7qUBrI&e=" rel="noreferrer" target="_blank">https://urldefense.proofpoint.<wbr>com/v2/url?u=https-3A__list.<wbr>coin-2Dor.org_mailman_<wbr>listinfo_cbc&d=DwICAg&c=Ngd-<wbr>ta5yRYsqeUsEDgxhcqsYYY1Xs5ogLx<wbr>WPA_2Wlc4&r=Vr27lhfGqB7S9o4_<wbr>CImgCU72HsP0kI1KcepC3i9tKp4&m=<wbr>LiDqRMpEzUn66neuP0IW6HFI9WfnwT<wbr>sFxMbLR5aEVFE&s=<wbr>4tRqRiU5wSrkNbiYeEabKEn1m8KSTB<wbr>RFMiAvn7qUBrI&e=</a><br>
<br></blockquote></div><br></div>