<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<HTML><HEAD>
<META content="text/html; charset=utf-8" http-equiv=Content-Type>
<META name=GENERATOR content="MSHTML 8.00.6001.18943">
<STYLE></STYLE>
</HEAD>
<BODY bgColor=#ffffff>
<DIV> </DIV>
<DIV style="FONT: 10pt arial">----- Original Message -----
<DIV style="BACKGROUND: #e4e4e4; font-color: black"><B>From:</B> <A
title=grun@cs.sfu.ca href="mailto:grun@cs.sfu.ca">Gabrielle A. Grun</A> </DIV>
<DIV><B>To:</B> <A title=cbc-tickets@list.coin-or.org
href="mailto:cbc-tickets@list.coin-or.org">cbc-tickets@list.coin-or.org</A>
</DIV>
<DIV><B>Sent:</B> Tuesday, October 05, 2010 4:07 PM</DIV>
<DIV><B>Subject:</B> Re: [Cbc-tickets] [COIN-OR Branch-and-Cut MIP Solver] #100:
Cbc 2.50 and MIPLIB 2003 pp08a.mps</DIV></DIV>
<DIV><BR></DIV>
<DIV><BR>HI Jcheng,<BR> <BR>There have been long-standing “Invalid heap”
issues with the tree in Cbc using Microsoft Visual Studio.<BR> <BR>The
predicate of test function has to obey the strict, weak ordering that if x
“is less than “y, y cannot be ranked less than x.<BR> <BR>Also, when a
“new” test function is utilized, the whole heap has to be
“re-ordered”.<BR> <BR>Lou Hafer has written replacement heap functions, and
I believe that work to rectify the problem has been implemented in Cbc stable
version 2.6.<BR> <BR>Thanks.<BR><BR>Gabrielle</DIV>
<BLOCKQUOTE
style="BORDER-LEFT: #000000 2px solid; PADDING-LEFT: 5px; PADDING-RIGHT: 0px; MARGIN-LEFT: 5px; MARGIN-RIGHT: 0px">
<DIV style="FONT: 10pt arial">----- Original Message ----- </DIV>
<DIV
style="FONT: 10pt arial; BACKGROUND: #e4e4e4; font-color: black"><B>From:</B>
<A title=coin-trac@coin-or.org href="mailto:coin-trac@coin-or.org">COIN-OR
Branch-and-Cut MIP Solver</A> </DIV>
<DIV style="FONT: 10pt arial"><B>Cc:</B> <A title=cbc-tickets@list.coin-or.org
href="mailto:cbc-tickets@list.coin-or.org">cbc-tickets@list.coin-or.org</A>
</DIV>
<DIV style="FONT: 10pt arial"><B>Sent:</B> Tuesday, October 05, 2010 9:22
AM</DIV>
<DIV style="FONT: 10pt arial"><B>Subject:</B> [Cbc-tickets] [COIN-OR
Branch-and-Cut MIP Solver] #100: Cbc 2.50 and MIPLIB 2003 pp08a.mps</DIV>
<DIV><BR></DIV>#100: Cbc 2.50 and MIPLIB 2003
pp08a.mps<BR>------------------------------+---------------------------------------------<BR>Reporter:
jcheng@…
| Type: task <BR>
Status:
new
| Priority:
trivial<BR> Version:
| Keywords:
<BR>------------------------------+---------------------------------------------<BR> The
cbcSolve was generated with Microsoft Visual C++ 9.0.<BR><BR> The run to
solve MIPLIB 2003 pp08a.mps generated "invalid heap" message<BR> when it
was executing<BR><BR>
std::pop_heap(nodes_.begin(), nodes_.end(), comparison_);<BR><BR> in
Cbctree.cpp (line 281).<BR><BR> Will any please help
me.<BR><BR> Thanks.<BR><BR>-- <BR>Ticket URL: <<A
href="https://projects.coin-or.org/Cbc/ticket/100">https://projects.coin-or.org/Cbc/ticket/100</A>><BR>COIN-OR
Branch-and-Cut MIP Solver <<A
href="http://projects.coin-or.org/Cbc">http://projects.coin-or.org/Cbc</A>><BR>An
LP-based branch-and-cut MIP
solver.<BR><BR>_______________________________________________<BR>Cbc-tickets
mailing list<BR><A
href="mailto:Cbc-tickets@list.coin-or.org">Cbc-tickets@list.coin-or.org</A><BR><A
href="http://list.coin-or.org/mailman/listinfo/cbc-tickets">http://list.coin-or.org/mailman/listinfo/cbc-tickets</A><BR></BLOCKQUOTE>
<DIV><BR> </DIV>
<DIV><BR>
<BR>Gabrielle A. Grün, Ph.D. Student<BR>School of Computing Science<BR>Simon
Fraser University<BR>8888 University Drive<BR>Burnaby, BC<BR>V5A 1S6<BR><<A
href="http://www.cs.sfu.ca/~grun">http://www.cs.sfu.ca/~grun</A>> </DIV>
<DIV> </DIV>
<DIV><BR> </DIV></BODY></HTML>