<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
</head>
<body text="#000000" bgcolor="#FFFFFF">
<p>Hi Daniel,</p>
<p>I'm not from the COIN-OR team. I was also interested in learning
how to use CBC with C++ few weeks ago, and I also struggled a bit
before getting something working. You can look at my
implementation for the Generalized Assignment Problem here
<a class="moz-txt-link-freetext" href="https://github.com/fontanf/gap/tree/master/opt_branchandcut_cbc">https://github.com/fontanf/gap/tree/master/opt_branchandcut_cbc</a>
Hopefully it might help you</p>
<p>Best regards,</p>
<p>Florian<br>
</p>
<div class="moz-cite-prefix">Le 22/07/2019 à 14:07, Daniel Grace a
écrit :<br>
</div>
<blockquote type="cite"
cite="mid:CAKYWhBYntZGr3iFSiWzY8B0Tv01kDERe=ntpqJgM2Wrch1310A@mail.gmail.com">
<meta http-equiv="content-type" content="text/html; charset=UTF-8">
<div dir="ltr">
<div style="font-family:arial,helvetica,sans-serif"
class="gmail_default">Hi,<br>
<br>
I am looking for some example code that uses COIN-OR to solve
a 0-1 mixed<br>
integer linear programming problem. In particular I'm looking
for some C code that stores the problem in an array before
calling the COIN-OR solver. I'm guessing that CBC is the
correct COIN-OR library to use for this type of problem?<br>
<br>
Thanks</div>
<div class="gmail_default"
style="font-family:arial,helvetica,sans-serif"><br>
</div>
</div>
<br>
<fieldset class="mimeAttachmentHeader"></fieldset>
<pre class="moz-quote-pre" wrap="">_______________________________________________
Cbc mailing list
<a class="moz-txt-link-abbreviated" href="mailto:Cbc@list.coin-or.org">Cbc@list.coin-or.org</a>
<a class="moz-txt-link-freetext" href="https://list.coin-or.org/mailman/listinfo/cbc">https://list.coin-or.org/mailman/listinfo/cbc</a>
</pre>
</blockquote>
</body>
</html>