Changeset 558 for html


Ignore:
Timestamp:
May 10, 2005 11:50:47 AM (14 years ago)
Author:
rlh
Message:

typo fixes

Location:
html/trunk/Cbc
Files:
18 edited

Legend:

Unmodified
Added
Removed
  • html/trunk/Cbc/apa.html

    r557 r558  
    11<?xml version="1.0" encoding="ISO-8859-1" standalone="no"?>
    2 <html xmlns="http://www.w3.org/1999/xhtml"><head><title>Appendix A. FAQ</title><meta name="generator" content="DocBook XSL Stylesheets V1.61.2"/><link rel="home" href="index.html" title="CBC User Guide"/><link rel="up" href="index.html" title="CBC User Guide"/><link rel="previous" href="ch09.html" title="Chapter 9. &#10;  Messages&#10;  "/><link rel="next" href="apb.html" title="Appendix B. Doxygen"/></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Appendix A. FAQ</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="ch09.html">Prev</a> </td><th width="60%" align="center"> </th><td width="20%" align="right"> <a accesskey="n" href="apb.html">Next</a></td></tr></table><hr/></div><div class="appendix" lang="en"><div class="titlepage"><div><div><h2 class="title"><a id="id3253852"/>Appendix A. FAQ</h2></div></div><div/></div><div class="qandaset"><table border="0" summary="Q and A Set"><col align="left" width="1%"/><tbody><tr class="question"><td align="left" valign="top"><a id="id3253216"/><a id="id3253875"/><b>Q:. </b></td><td align="left" valign="top"><p>
     2<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Appendix A. FAQ</title><meta name="generator" content="DocBook XSL Stylesheets V1.61.2"/><link rel="home" href="index.html" title="CBC User Guide"/><link rel="up" href="index.html" title="CBC User Guide"/><link rel="previous" href="ch09.html" title="Chapter 9. &#10;  Messages&#10;  "/><link rel="next" href="apb.html" title="Appendix B. Doxygen"/></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Appendix A. FAQ</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="ch09.html">Prev</a> </td><th width="60%" align="center"> </th><td width="20%" align="right"> <a accesskey="n" href="apb.html">Next</a></td></tr></table><hr/></div><div class="appendix" lang="en"><div class="titlepage"><div><div><h2 class="title"><a id="id2992970"/>Appendix A. FAQ</h2></div></div><div/></div><div class="qandaset"><table border="0" summary="Q and A Set"><col align="left" width="1%"/><tbody><tr class="question"><td align="left" valign="top"><a id="id2992333"/><a id="id2992993"/><b>Q:. </b></td><td align="left" valign="top"><p>
    33  What is <a href="http://www.coin-or.org/faqs.html#CBC" target="_top">CBC</a>?
    44  </p></td></tr><tr class="answer"><td align="left" valign="top"><b>A:. </b></td><td align="left" valign="top"><p>
     
    99  library (though a rudimentary stand-alone executable exists).
    1010  The first documented release was .90.0  The current release is version .90.0. (JF 04/01/05)
    11   </p></td></tr><tr class="question"><td align="left" valign="top"><a id="id3253930"/><a id="id3253933"/><b>Q:. </b></td><td align="left" valign="top"><p>
     11  </p></td></tr><tr class="question"><td align="left" valign="top"><a id="id2993048"/><a id="id2993051"/><b>Q:. </b></td><td align="left" valign="top"><p>
    1212  What are some of the features of CBC?
    1313  </p></td></tr><tr class="answer"><td align="left" valign="top"><b>A:. </b></td><td align="left" valign="top"><p>
    1414  CBC allows the use of any CGL cuts and the use of heuristics and
    1515   specialized branching methods. (JF 04/01/05)
    16   </p></td></tr><tr class="question"><td align="left" valign="top"><a id="id3254869"/><a id="id3254872"/><b>Q:. </b></td><td align="left" valign="top"><p>
     16  </p></td></tr><tr class="question"><td align="left" valign="top"><a id="id2993987"/><a id="id2993990"/><b>Q:. </b></td><td align="left" valign="top"><p>
    1717  How do I obtain and install CBC?
    1818  </p></td></tr><tr class="answer"><td align="left" valign="top"><b>A:. </b></td><td align="left" valign="top"><p>
     
    2424  <a href="http://www.coin-or.org/faqs.html#BuildCode" target="_top">install</a>
    2525  COIN-OR modules. (JF 04/01/05)
    26   </p></td></tr><tr class="question"><td align="left" valign="top"><a id="id3254918"/><a id="id3254921"/><b>Q:. </b></td><td align="left" valign="top"><p>
     26  </p></td></tr><tr class="question"><td align="left" valign="top"><a id="id2994036"/><a id="id2994039"/><b>Q:. </b></td><td align="left" valign="top"><p>
    2727  Is CBC reliable?
    2828  </p></td></tr><tr class="answer"><td align="left" valign="top"><b>A:. </b></td><td align="left" valign="top"><p>
    2929  CBC has been tested on many problems,
    3030  but more testing and improvement is needed before it can get to version 1.0. (JF 04/01/05)
    31   </p></td></tr><tr class="question"><td align="left" valign="top"><a id="id3254944"/><a id="id3254947"/><b>Q:. </b></td><td align="left" valign="top"><p>
     31  </p></td></tr><tr class="question"><td align="left" valign="top"><a id="id2994062"/><a id="id2994065"/><b>Q:. </b></td><td align="left" valign="top"><p>
    3232  Is there any documentation for CBC? 
    3333  </p></td></tr><tr class="answer"><td align="left" valign="top"><b>A:. </b></td><td align="left" valign="top"><p>
     
    3636  <a href="http://www.coin-or.org/Doxygen/Cbc/" target="_top">CBC class descriptions</a> generated
    3737  by <a href="http://www.doxygen.org" target="_top">Doxygen</a>. (JF 04/01/05)
    38   </p></td></tr><tr class="question"><td align="left" valign="top"><a id="id3254985"/><a id="id3254988"/><b>Q:. </b></td><td align="left" valign="top"><p>
     38  </p></td></tr><tr class="question"><td align="left" valign="top"><a id="id2994103"/><a id="id2994106"/><b>Q:. </b></td><td align="left" valign="top"><p>
    3939  Is CBC as fast as Cplex or Xpress?
    4040  </p></td></tr><tr class="answer"><td align="left" valign="top"><b>A:. </b></td><td align="left" valign="top"><p>
    4141   No. However its design is much more flexible so advanced users
    4242   will be able to tailor CBC to their needs. (JF 04/01/05)
    43   </p></td></tr><tr class="question"><td align="left" valign="top"><a id="id3255011"/><a id="id3255014"/><b>Q:. </b></td><td align="left" valign="top"><p>
     43  </p></td></tr><tr class="question"><td align="left" valign="top"><a id="id2994129"/><a id="id2994132"/><b>Q:. </b></td><td align="left" valign="top"><p>
    4444  When will version 1.0 of CBC be available? 
    4545  </p></td></tr><tr class="answer"><td align="left" valign="top"><b>A:. </b></td><td align="left" valign="top"><p>
    4646  It is expected that version 1.0 will be released in time for the 2005
    4747  <a href="http://www.informs.org" target="_top">INFORMS</a> annual meeting. (JF 04/01/05)
    48   </p></td></tr><tr class="question"><td align="left" valign="top"><a id="id3255045"/><a id="id3255048"/><b>Q:. </b></td><td align="left" valign="top"><p>
     48  </p></td></tr><tr class="question"><td align="left" valign="top"><a id="id2994163"/><a id="id2994166"/><b>Q:. </b></td><td align="left" valign="top"><p>
    4949  What can the community do to help?
    5050  </p></td></tr><tr class="answer"><td align="left" valign="top"><b>A:. </b></td><td align="left" valign="top"><p>
  • html/trunk/Cbc/apc.html

    r557 r558  
    11<?xml version="1.0" encoding="ISO-8859-1" standalone="no"?>
    2 <html xmlns="http://www.w3.org/1999/xhtml"><head><title>Appendix C. Revision History</title><meta name="generator" content="DocBook XSL Stylesheets V1.61.2"/><link rel="home" href="index.html" title="CBC User Guide"/><link rel="up" href="index.html" title="CBC User Guide"/><link rel="previous" href="apb.html" title="Appendix B. Doxygen"/></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Appendix C. Revision History</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="apb.html">Prev</a> </td><th width="60%" align="center"> </th><td width="20%" align="right"> </td></tr></table><hr/></div><div class="appendix" lang="en"><div class="titlepage"><div><div><h2 class="title"><a id="id3253602"/>Appendix C. Revision History</h2></div></div><div/></div><div class="revhistory"><table border="0" width="100%" summary="Revision history"><tr><th align="left" valign="top" colspan="3"><b>Revision History</b></th></tr><tr><td align="left">Revision 0.21</td><td align="left">May 10, 2005</td><td align="left">RLH</td></tr><tr><td align="left" colspan="3">Fixed typos caught by Cole Smith, editor of the INFORMS Tutorial Book, and added place holders for needs-to-be-written sections, e.g., Using CGL with CBC.</td></tr><tr><td align="left">Revision 0.2</td><td align="left">May 2, 2005</td><td align="left">RLH</td></tr><tr><td align="left" colspan="3">Book chapter for CBC Tutorial at INFORMS 2005 annual meeting. Reorganized the content. Added CBC Messages. Changed the font type to distinguish functions/variables/classnames/code from text.</td></tr><tr><td align="left">Revision 0.1</td><td align="left">April 1, 2005</td><td align="left">JF</td></tr><tr><td align="left" colspan="3">First draft. The CBC documentation uses the DocBook CLP documentation created by David de la Nuez.</td></tr></table></div></div><div class="navfooter"><hr/><table width="100%" summary="Navigation footer"><tr><td width="40%" align="left"><a accesskey="p" href="apb.html">Prev</a> </td><td width="20%" align="center"><a accesskey="u" href="index.html">Up</a></td><td width="40%" align="right"> </td></tr><tr><td width="40%" align="left" valign="top">Appendix B. Doxygen </td><td width="20%" align="center"><a accesskey="h" href="index.html">Home</a></td><td width="40%" align="right" valign="top"> </td></tr></table></div></body></html>
     2<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Appendix C. Revision History</title><meta name="generator" content="DocBook XSL Stylesheets V1.61.2"/><link rel="home" href="index.html" title="CBC User Guide"/><link rel="up" href="index.html" title="CBC User Guide"/><link rel="previous" href="apb.html" title="Appendix B. Doxygen"/></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Appendix C. Revision History</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="apb.html">Prev</a> </td><th width="60%" align="center"> </th><td width="20%" align="right"> </td></tr></table><hr/></div><div class="appendix" lang="en"><div class="titlepage"><div><div><h2 class="title"><a id="id2992720"/>Appendix C. Revision History</h2></div></div><div/></div><div class="revhistory"><table border="0" width="100%" summary="Revision history"><tr><th align="left" valign="top" colspan="3"><b>Revision History</b></th></tr><tr><td align="left">Revision 0.21</td><td align="left">May 10, 2005</td><td align="left">RLH</td></tr><tr><td align="left" colspan="3">Fixed typos caught by Cole Smith, editor of the INFORMS Tutorial Book, and added place holders for needs-to-be-written sections, e.g., Using CGL with CBC.</td></tr><tr><td align="left">Revision 0.2</td><td align="left">May 2, 2005</td><td align="left">RLH</td></tr><tr><td align="left" colspan="3">Book chapter for CBC Tutorial at INFORMS 2005 annual meeting. Reorganized the content. Added CBC Messages. Changed the font type to distinguish functions/variables/classnames/code from text.</td></tr><tr><td align="left">Revision 0.1</td><td align="left">April 1, 2005</td><td align="left">JF</td></tr><tr><td align="left" colspan="3">First draft. The CBC documentation uses the DocBook CLP documentation created by David de la Nuez.</td></tr></table></div></div><div class="navfooter"><hr/><table width="100%" summary="Navigation footer"><tr><td width="40%" align="left"><a accesskey="p" href="apb.html">Prev</a> </td><td width="20%" align="center"><a accesskey="u" href="index.html">Up</a></td><td width="40%" align="right"> </td></tr><tr><td width="40%" align="left" valign="top">Appendix B. Doxygen </td><td width="20%" align="center"><a accesskey="h" href="index.html">Home</a></td><td width="40%" align="right" valign="top"> </td></tr></table></div></body></html>
  • html/trunk/Cbc/cbcuserguide.html

    r557 r558  
    2727</div></div></div><div></div><hr /></div><div class="toc"><p><b>Table of Contents</b></p><dl><dt>1. <a href="#intro">
    2828    Introduction
    29   </a></dt><dd><dl><dt><a href="#id2968004">
     29  </a></dt><dd><dl><dt><a href="#id2934606">
    3030  Welcome to CBC
    31   </a></dt><dt><a href="#id2967833">
     31  </a></dt><dt><a href="#id2934435">
    3232  Prerequisites
    33   </a></dt><dt><a href="#id2967708">Preliminaries</a></dt><dt><a href="#id3038724">
     33  </a></dt><dt><a href="#id2934309">Preliminaries</a></dt><dt><a href="#id3005326">
    3434Branch-and-Cut Overview
    3535</a></dt></dl></dd><dt>2. <a href="#cbcmodelclass">
     
    5757</a></dt><dd><dl><dt><a href="#solver">Creating a Solver via Inheritance</a></dt><dt><a href="#quadratic">Quadratic MIP</a></dt></dl></dd><dt>8. <a href="#moreexamples">
    5858More Samples
    59 </a></dt><dd><dl><dt><a href="#id3049424">CBC's Samples Directory</a></dt></dl></dd><dt>9. <a href="#messages">
     59</a></dt><dd><dl><dt><a href="#id3016028">CBC's Samples Directory</a></dt></dl></dd><dt>9. <a href="#messages">
    6060  Messages
    61   </a></dt><dt>A. <a href="#id3055917">FAQ</a></dt><dt>B. <a href="#doxygen">Doxygen</a></dt><dt>C. <a href="#id3055667">Revision History</a></dt></dl></div><div class="list-of-tables"><p><b>List of Tables</b></p><dl><dt>1.1. <a href="#assClasses">Associated Classes</a></dt><dt>2.1. <a href="#id3040696">
     61  </a></dt><dt>A. <a href="#id3022520">FAQ</a></dt><dt>B. <a href="#doxygen">Doxygen</a></dt><dt>C. <a href="#id3022271">Revision History</a></dt></dl></div><div class="list-of-tables"><p><b>List of Tables</b></p><dl><dt>1.1. <a href="#assClasses">Associated Classes</a></dt><dt>2.1. <a href="#id3007298">
    6262  Methods for Getting Solution Information from OSI
    63   </a></dt><dt>2.2. <a href="#setGet">Useful Set and Get Methods in CbcModel</a></dt><dt>2.3. <a href="#id3042180">Classes Used by CbcModel - Most Useful</a></dt><dt>2.4. <a href="#least">Classes Used by CbcModel - Least Useful</a></dt><dt>3.1. <a href="#compareTable">Compare Classes Provided</a></dt><dt>3.2. <a href="#nodeTable">Information Available from CbcNode</a></dt><dt>8.1. <a href="#id3050381">Basic Samples</a></dt><dt>8.2. <a href="#id3050556">Advanced Samples</a></dt><dt>9.1. <a href="#id3051858">
     63  </a></dt><dt>2.2. <a href="#setGet">Useful Set and Get Methods in CbcModel</a></dt><dt>2.3. <a href="#id3008782">Classes Used by CbcModel - Most Useful</a></dt><dt>2.4. <a href="#least">Classes Used by CbcModel - Least Useful</a></dt><dt>3.1. <a href="#compareTable">Compare Classes Provided</a></dt><dt>3.2. <a href="#nodeTable">Information Available from CbcNode</a></dt><dt>8.1. <a href="#id3016985">Basic Samples</a></dt><dt>8.2. <a href="#id3017159">Advanced Samples</a></dt><dt>9.1. <a href="#id3018462">
    6464  CBC Messages Passed At Log Level 0
    65   </a></dt><dt>9.2. <a href="#id3052003">
     65  </a></dt><dt>9.2. <a href="#id3018606">
    6666  CBC Messages Passed At or Above Log Level 1
    67   </a></dt><dt>9.3. <a href="#id3053367">
     67  </a></dt><dt>9.3. <a href="#id3019970">
    6868  CBC Messages Passed At or Above Log Level 2
    69   </a></dt><dt>9.4. <a href="#id3053768">
     69  </a></dt><dt>9.4. <a href="#id3020371">
    7070  CBC Messages Passed At or Above Log Level 3
    71   </a></dt></dl></div><div class="list-of-examples"><p><b>List of Examples</b></p><dl><dt>2.1. <a href="#minimum.cpp">minimum.cpp</a></dt><dt>3.1. <a href="#test">CbcCompareUser::test()</a></dt><dt>3.2. <a href="#newSolution">CbcCompareUser::newSolution()</a></dt><dt>3.3. <a href="#everyK">CbcCompareUser::every1000Nodes()</a></dt><dt>4.1. <a href="#id3047001">Data</a></dt><dt>4.2. <a href="#id3047030">Initialize newSolution</a></dt><dt>4.3. <a href="#id3047111">Create Feasible newSolution from Initial newSolution</a></dt><dt>4.4. <a href="#id3047155">Check Solution Quality of newSolution</a></dt><dt>5.1. <a href="#pseudo">CbcSimpleIntegerPseudoCosts</a></dt><dt>5.2. <a href="#id3047524">CbcFollowOn</a></dt><dt>7.1. <a href="#initialSolve">initialSolve()</a></dt><dt>7.2. <a href="#id3047792">First Few Solves</a></dt><dt>7.3. <a href="#id3047820">Create Small Sub-Problem</a></dt><dt>7.4. <a href="#id3047866">Check Optimal Solution</a></dt><dt>7.5. <a href="#id3047932">Solving a Quadratic MIP</a></dt></dl></div><div class="chapter" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title"><a id="intro"></a>Chapter 1. 
     71  </a></dt></dl></div><div class="list-of-examples"><p><b>List of Examples</b></p><dl><dt>2.1. <a href="#minimum.cpp">minimum.cpp</a></dt><dt>3.1. <a href="#test">CbcCompareUser::test()</a></dt><dt>3.2. <a href="#newSolution">CbcCompareUser::newSolution()</a></dt><dt>3.3. <a href="#everyK">CbcCompareUser::every1000Nodes()</a></dt><dt>4.1. <a href="#id3013604">Data</a></dt><dt>4.2. <a href="#id3013633">Initialize newSolution</a></dt><dt>4.3. <a href="#id3013713">Create Feasible newSolution from Initial newSolution</a></dt><dt>4.4. <a href="#id3013758">Check Solution Quality of newSolution</a></dt><dt>5.1. <a href="#pseudo">CbcSimpleIntegerPseudoCosts</a></dt><dt>5.2. <a href="#id3014127">CbcFollowOn</a></dt><dt>7.1. <a href="#initialSolve">initialSolve()</a></dt><dt>7.2. <a href="#id3014395">First Few Solves</a></dt><dt>7.3. <a href="#id3014423">Create Small Sub-Problem</a></dt><dt>7.4. <a href="#id3014469">Check Optimal Solution</a></dt><dt>7.5. <a href="#id3014535">Solving a Quadratic MIP</a></dt></dl></div><div class="chapter" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title"><a id="intro"></a>Chapter 1. 
    7272    Introduction
    73   </h2></div></div><div></div></div><div class="toc"><p><b>Table of Contents</b></p><dl><dt><a href="#id2968004">
     73  </h2></div></div><div></div></div><div class="toc"><p><b>Table of Contents</b></p><dl><dt><a href="#id2934606">
    7474  Welcome to CBC
    75   </a></dt><dt><a href="#id2967833">
     75  </a></dt><dt><a href="#id2934435">
    7676  Prerequisites
    77   </a></dt><dt><a href="#id2967708">Preliminaries</a></dt><dt><a href="#id3038724">
     77  </a></dt><dt><a href="#id2934309">Preliminaries</a></dt><dt><a href="#id3005326">
    7878Branch-and-Cut Overview
    79 </a></dt></dl></div><div class="section" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="id2968004"></a>
     79</a></dt></dl></div><div class="section" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="id2934606"></a>
    8080  Welcome to CBC
    8181  </h2></div></div><div></div></div><p>
    8282  The COIN
    83     <sup>[<a id="id2968015" href="#ftn.id2968015">1</a>]</sup>
     83    <sup>[<a id="id2934617" href="#ftn.id2934617">1</a>]</sup>
    8484Branch and Cut solver (CBC) is an open-source mixed-integer program (MIP) solver written  in C++. CBC is intended to be used primarily as a callable library to create customized branch-and-cut solvers. A basic, stand-alone  executable version is also available. CBC is an active open-source project led by John Forrest at www.coin-or.org.
    85  </p></div><div class="section" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="id2967833"></a>
     85 </p></div><div class="section" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="id2934435"></a>
    8686  Prerequisites
    8787  </h2></div></div><div></div></div><p>
     
    102102In summary, readers should have the following prerequisites:
    103103   </p><div class="itemizedlist"><ul type="disc"><li>C++ knowledge,</li><li>LP and MIP fundamentals, and </li><li>OSI familiarity.</li></ul></div><p>
    104 </p></div><div class="section" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="id2967708"></a>Preliminaries</h2></div></div><div></div></div><p>
     104</p></div><div class="section" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="id2934309"></a>Preliminaries</h2></div></div><div></div></div><p>
    105105  </p><div class="itemizedlist"><ul type="disc"><li>Unless otherwise stated, the problem being optimized is a minimization problem. </li><li>The terms "model" and "problem" are used synonymously.</li><li>Notation: We use the convention of appending an underscore to
    106106              a variable in order to distinguish member data of a class.</li><li>The Cbc Samples directory, <tt class="filename">COIN/Cbc/Samples</tt>
     
    108108              purposes of the CBC concepts and usage. The sample code is not
    109109              necessarily written for performance.</li></ul></div><p>
    110 </p></div><div class="section" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="id3038724"></a>
     110</p></div><div class="section" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="id3005326"></a>
    111111Branch-and-Cut Overview
    112112</h2></div></div><div></div></div><p>
     
    116116 </p><p> 
    117117Step 2. (Branch) Otherwise, there exists an "integer" variable with a non-integral value. Choose one non-integral variable (e.g., with value 1.3) (A)(B) and branch. Create two
    118 <sup>[<a id="id3038892" href="#ftn.id3038892">2</a>]</sup>
     118<sup>[<a id="id3005494" href="#ftn.id3005494">2</a>]</sup>
    119119nodes, one with the branching variable having an upper bound of 1.0, and the other with the branching variable having a lower bound of 2.0. Add the two nodes to the search tree.
    120120 </p><p>
     
    189189  behavior of the source code, the comments in the header files, found in
    190190  <tt class="filename">COIN/Cbc/include</tt>, are the ultimate reference.
    191   </p></div><div class="footnotes"><br /><hr width="100" align="left" /><div class="footnote"><p><sup>[<a id="ftn.id2968015" href="#id2968015">1</a>] </sup>
     191  </p></div><div class="footnotes"><br /><hr width="100" align="left" /><div class="footnote"><p><sup>[<a id="ftn.id2934617" href="#id2934617">1</a>] </sup>
    192192        The complete acronym is "COIN-OR" which stands for the Compuational Infrastructure for Operations Research. For simplicity (and in keeping with the directory and function names) we will simply use "COIN".
    193         </p></div><div class="footnote"><p><sup>[<a id="ftn.id3038892" href="#id3038892">2</a>] </sup>
     193        </p></div><div class="footnote"><p><sup>[<a id="ftn.id3005494" href="#id3005494">2</a>] </sup>
    194194The current implementation of CBC allow two branches to be created. More general number of branches could be implemented.
    195195</p></div></div></div><div class="chapter" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title"><a id="cbcmodelclass"></a>Chapter 2. 
     
    293293  </p><p>
    294294  In addition to these <tt class="classname">CbcModel</tt> methods, solution values can be accessed via OSI methods.  The OSI methods pick up the current solution in the <tt class="classname">CBCModel</tt>.  The current solution will match the best solution found so far if called after <tt class="function">branchAndBound()</tt> and a solution was found.
    295   </p><div class="table"><a id="id3040696"></a><p class="title"><b>Table 2.1. 
     295  </p><div class="table"><a id="id3007298"></a><p class="title"><b>Table 2.1. 
    296296  Methods for Getting Solution Information from OSI
    297297  </b></p><table summary="&#10;  Methods for Getting Solution Information from OSI &#10;  " border="0"><colgroup><col /><col /></colgroup><thead><tr><th>
     
    340340      possible solution is less than this <i class="parameter"><tt>value</tt></i>, or as a percentage, or a fraction.
    341341      </td></tr><tr><td align="left" valign="top"><tt class="function">void setNumberStrong(double value) </tt><br /><tt class="function">int numberStrong()
    342 <sup>[<a id="id3041432" href="#ftn.id3041432">a</a>]</sup> const </tt></td><td align="left" valign="top">
     342<sup>[<a id="id3008034" href="#ftn.id3008034">a</a>]</sup> const </tt></td><td align="left" valign="top">
    343343      These methods set or get the maximum number of candidates at a node to
    344344      be evaluated for strong branching.
     
    369369      This method returns a pointer to a column copy of matrix stored as a
    370370      <tt class="classname">CoinPackedMatrix</tt> which can be further examined.
    371       </td></tr><tr><td align="left" valign="top"><tt class="function">CoinBigIndex getNumElements() const</tt><sup>[<a id="id3041985" href="#ftn.id3041985">b</a>]</sup></td><td align="left" valign="top">
     371      </td></tr><tr><td align="left" valign="top"><tt class="function">CoinBigIndex getNumElements() const</tt><sup>[<a id="id3008587" href="#ftn.id3008587">b</a>]</sup></td><td align="left" valign="top">
    372372      Returns the number of nonzero elements in the problem matrix.
    373373      </td></tr><tr><td align="left" valign="top"><tt class="function">void setObjSense(double value)</tt><br /><tt class="function">double getObjSense() const</tt></td><td align="left" valign="top">
    374374      These methods set and get the objective sense.  The parameter
    375375      <i class="parameter"><tt>value</tt></i> should be +1 to minimize and -1 to maximize.
    376       </td></tr></tbody><tbody class="footnotes"><tr><td colspan="2"><div class="footnote"><p><sup>[<a id="ftn.id3041432" href="#id3041432">a</a>] </sup>
     376      </td></tr></tbody><tbody class="footnotes"><tr><td colspan="2"><div class="footnote"><p><sup>[<a id="ftn.id3008034" href="#id3008034">a</a>] </sup>
    377377This methods (and some of the other) do not follow the "get" convention. The convention has changed over time and there are still some inconsistencies to be cleaned up.
    378 </p></div><div class="footnote"><p><sup>[<a id="ftn.id3041985" href="#id3041985">b</a>] </sup>
     378</p></div><div class="footnote"><p><sup>[<a id="ftn.id3008587" href="#id3008587">b</a>] </sup>
    379379        <span class="type">CoinBigIndex</span> is a <tt class="function">typedef</tt> which in
    380380        most cases is the same as <span class="type">int</span>.
     
    397397
    398398To enable this flexibility,  <tt class="classname">CbcModel</tt> uses other classes in CBC (some of which are virtual and may have multiple instances). Not all classes are created equal. The two tables below list in alphabetical order the classes used by <tt class="classname">CbcModel</tt> that are of most interest and of least interest.
    399 </p><div class="table"><a id="id3042180"></a><p class="title"><b>Table 2.3. Classes Used by CbcModel - Most Useful</b></p><table summary="Classes Used by CbcModel - Most Useful" border="0"><colgroup><col /><col /><col /></colgroup><thead><tr><th>
     399</p><div class="table"><a id="id3008782"></a><p class="title"><b>Table 2.3. Classes Used by CbcModel - Most Useful</b></p><table summary="Classes Used by CbcModel - Most Useful" border="0"><colgroup><col /><col /><col /></colgroup><thead><tr><th>
    400400    Class name
    401401    </th><th>
     
    489489       Depth of the node in the search tree.
    490490      </td></tr><tr><td align="left" valign="top"><tt class="function">double guessedObjectiveValue() const</tt></td><td align="left" valign="top">
    491      If user was setting this (e.g., if using pseudo costs).
     491     Displays the guessed objective value, if the user was setting this (e.g., if using pseudo costs).
    492492      </td></tr><tr><td align="left" valign="top"><tt class="function">int way() const</tt></td><td align="left" valign="top">
    493493       The way which branching would next occur from this node
     
    622622                                              double * betterSolution)</tt>.
    623623  The <tt class="function">solution()</tt> method returns 0 if no solution found, and returns 1 if a solution is found, in which case it fills in the objective value and primal solution.  The code in <tt class="filename">CbcHeuristicGreedy.cpp</tt> is a little more complicated than this following example. For instance, the code here assumes all variables are integer.  The important bit of data is a copy of the matrix (stored by column) before any cuts have been made.  The data used are bounds, objective and the matrix plus two work arrays.
    624   </p><div class="example"><a id="id3047001"></a><p class="title"><b>Example 4.1. Data</b></p><pre class="programlisting">
     624  </p><div class="example"><a id="id3013604"></a><p class="title"><b>Example 4.1. Data</b></p><pre class="programlisting">
    625625   
    626626  OsiSolverInterface * solver = model_-&gt;solver(); // Get solver from CbcModel
     
    648648  </pre></div><p>
    649649The <tt class="varname">newSolution</tt> is then initialized to the rounded down solution.
    650 </p><div class="example"><a id="id3047030"></a><p class="title"><b>Example 4.2. Initialize <tt class="varname">newSolution</tt></b></p><pre class="programlisting">
     650</p><div class="example"><a id="id3013633"></a><p class="title"><b>Example 4.2. Initialize <tt class="varname">newSolution</tt></b></p><pre class="programlisting">
    651651   
    652652  for (iColumn=0;iColumn&lt;numberColumns;iColumn++) {
     
    675675
    676676At this point some row activities are below their lower bound. To correct the infeasibility, the variable which is cheapest in reducing the sum of infeasibilities is found and updated, and the process repeats.  This is a finite process. (The implementation could be faster, but is kept simple for illustrative purposes.)
    677   </p><div class="example"><a id="id3047111"></a><p class="title"><b>Example 4.3. Create Feasible <tt class="varname">newSolution</tt> from Initial <tt class="varname">newSolution</tt></b></p><pre class="programlisting">
     677  </p><div class="example"><a id="id3013713"></a><p class="title"><b>Example 4.3. Create Feasible <tt class="varname">newSolution</tt> from Initial <tt class="varname">newSolution</tt></b></p><pre class="programlisting">
    678678   
    679679  while (true) {
     
    722722  </pre></div><p>
    723723A solution value of <tt class="varname">newSolution</tt> is compared to the best solution value. If <tt class="varname">newSolution</tt> is an improvement, its feasibility is validated. We expect <tt class="varname">newSolution</tt> to be feasible, and are trapping for unexpected numerical errors.
    724   </p><div class="example"><a id="id3047155"></a><p class="title"><b>Example 4.4. Check Solution Quality of <tt class="varname">newSolution</tt></b></p><pre class="programlisting">
     724  </p><div class="example"><a id="id3013758"></a><p class="title"><b>Example 4.4. Check Solution Quality of <tt class="varname">newSolution</tt></b></p><pre class="programlisting">
    725725   
    726726  returnCode=0; // 0 means no good solution
     
    825825variables are left which may be necessary if other sorts of constraints exist. Follow-on branching rules are to be considered first, so the priorities are set to indicate the follow-on rules take precedence. Priority 1 is the highest priority.
    826826
    827 </p><div class="example"><a id="id3047524"></a><p class="title"><b>Example 5.2. <tt class="classname">CbcFollowOn</tt></b></p><pre class="programlisting">
     827</p><div class="example"><a id="id3014127"></a><p class="title"><b>Example 5.2. <tt class="classname">CbcFollowOn</tt></b></p><pre class="programlisting">
    828828   
    829829  int iColumn;
     
    892892a variable was active in a solution.  For the first few solves, the normal Dual Simplex is called and
    893893<tt class="varname">node_</tt> array is updated.
    894 </p><div class="example"><a id="id3047792"></a><p class="title"><b>Example 7.2. First Few Solves</b></p><pre class="programlisting">
     894</p><div class="example"><a id="id3014395"></a><p class="title"><b>Example 7.2. First Few Solves</b></p><pre class="programlisting">
    895895   
    896896  if (count_&lt;10) {
     
    913913After the first few solves, only those variables which took part in a solution in the last so many
    914914solves are used.  As fast0507 is a set covering problem, any rows which are already covered can be taken out.
    915   </p><div class="example"><a id="id3047820"></a><p class="title"><b>Example 7.3. Create Small Sub-Problem</b></p><pre class="programlisting">
     915  </p><div class="example"><a id="id3014423"></a><p class="title"><b>Example 7.3. Create Small Sub-Problem</b></p><pre class="programlisting">
    916916   
    917917    int * whichRow = new int[numberRows]; // Array to say which rows used
     
    10091009If the variables cover the rows, then the problem is feasible (no cuts are being used). (If the rows
    10101010were equality constraints, then this might not be the case. More work would be needed.)  After the solution to the subproblem, the reduced costs of the full problem are checked. If the reduced cost of any variable not in the subproblem is negative, the code goes back to the full problem and cleans up with Primal Simplex.
    1011   </p><div class="example"><a id="id3047866"></a><p class="title"><b>Example 7.4. Check Optimal Solution</b></p><pre class="programlisting">
     1011  </p><div class="example"><a id="id3014469"></a><p class="title"><b>Example 7.4. Check Optimal Solution</b></p><pre class="programlisting">
    10121012   
    10131013    temp-&gt;setDualObjectiveLimit(1.0e50); // Switch off dual cutoff as problem is restricted
     
    10661066More Samples
    10671067</i></a>).
    1068   </p><div class="example"><a id="id3047932"></a><p class="title"><b>Example 7.5. Solving a Quadratic MIP</b></p><pre class="programlisting">
     1068  </p><div class="example"><a id="id3014535"></a><p class="title"><b>Example 7.5. Solving a Quadratic MIP</b></p><pre class="programlisting">
    10691069   
    10701070  // save cutoff
     
    10941094</p></div></div><div class="chapter" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title"><a id="moreexamples"></a>Chapter 8. 
    10951095More Samples
    1096 </h2></div></div><div></div></div><div class="toc"><p><b>Table of Contents</b></p><dl><dt><a href="#id3049424">CBC's Samples Directory</a></dt></dl></div><div class="section" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="id3049424"></a>CBC's Samples Directory</h2></div></div><div></div></div><p>
     1096</h2></div></div><div></div></div><div class="toc"><p><b>Table of Contents</b></p><dl><dt><a href="#id3016028">CBC's Samples Directory</a></dt></dl></div><div class="section" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="id3016028"></a>CBC's Samples Directory</h2></div></div><div></div></div><p>
    10971097The CBC distribution includes a number of <tt class="filename">.cpp</tt> sample files.
    10981098Users are encouraged to use them as starting points for their own CBC projects.
     
    11021102by </p><pre class="programlisting">make DRIVER=name</pre><p> which produces an executable <tt class="filename">testit</tt>.  Below is a list of
    11031103some of the most useful sample files with a short description for each file.
    1104 </p><div class="table"><a id="id3050381"></a><p class="title"><b>Table 8.1. Basic Samples</b></p><table summary="Basic Samples" border="0"><colgroup><col /><col /></colgroup><thead><tr><th align="left" valign="bottom">
     1104</p><div class="table"><a id="id3016985"></a><p class="title"><b>Table 8.1. Basic Samples</b></p><table summary="Basic Samples" border="0"><colgroup><col /><col /></colgroup><thead><tr><th align="left" valign="bottom">
    11051105        Source file       
    11061106        </th><th align="left" valign="bottom">
     
    11171117        <tt class="function">CbcHeuristicUser.cpp</tt>
    11181118        with corresponding <tt class="function">*.hpp</tt> files.
    1119         </td></tr></tbody></table></div><div class="table"><a id="id3050556"></a><p class="title"><b>Table 8.2. Advanced Samples</b></p><table summary="Advanced Samples" border="0"><colgroup><col /><col /></colgroup><thead><tr><th align="left" valign="bottom">
     1119        </td></tr></tbody></table></div><div class="table"><a id="id3017159"></a><p class="title"><b>Table 8.2. Advanced Samples</b></p><table summary="Advanced Samples" border="0"><colgroup><col /><col /></colgroup><thead><tr><th align="left" valign="bottom">
    11201120        Source file       
    11211121        </th><th align="left" valign="bottom">
     
    11691169    </li><li>
    11701170    Log Level 3: Tremendous amount of information, e.g., multiple messages per node.
    1171     </li></ul></div><div class="table"><a id="id3051858"></a><p class="title"><b>Table 9.1. 
     1171    </li></ul></div><div class="table"><a id="id3018462"></a><p class="title"><b>Table 9.1. 
    11721172  CBC Messages Passed At Log Level 0
    11731173  </b></p><table summary="&#10;  CBC Messages Passed At Log Level 0&#10;  " border="0"><colgroup><col /><col /><col /><col /></colgroup><thead><tr><th align="center">
     
    11791179      </td><td> </td><td align="left"><tt class="computeroutput">No integer variables - nothing to do</tt></td><td class="auto-generated"> </td></tr><tr><td colspan="2"> </td><td align="left"><p>
    11801180
    1181       </p></td><td class="auto-generated"> </td></tr></tbody></table></div><div class="table"><a id="id3052003"></a><p class="title"><b>Table 9.2. 
     1181      </p></td><td class="auto-generated"> </td></tr></tbody></table></div><div class="table"><a id="id3018606"></a><p class="title"><b>Table 9.2. 
    11821182  CBC Messages Passed At or Above Log Level 1
    11831183  </b></p><table summary="&#10;  CBC Messages Passed At or Above Log Level 1&#10;  " border="0"><colgroup><col /><col /><col /><col /></colgroup><thead><tr><th align="center">
     
    13031303      </tt></td><td class="auto-generated"> </td></tr><tr><td colspan="2"> </td><td align="left"><p>
    13041304     
    1305       </p></td><td class="auto-generated"> </td></tr></tbody></table></div><div class="table"><a id="id3053367"></a><p class="title"><b>Table 9.3. 
     1305      </p></td><td class="auto-generated"> </td></tr></tbody></table></div><div class="table"><a id="id3019970"></a><p class="title"><b>Table 9.3. 
    13061306  CBC Messages Passed At or Above Log Level 2
    13071307  </b></p><table summary="&#10;  CBC Messages Passed At or Above Log Level 2&#10;  " border="0"><colgroup><col /><col /><col /><col /></colgroup><thead><tr><th align="center">
     
    13331333      </tt></td><td class="auto-generated"> </td></tr><tr><td colspan="2"> </td><td align="left"><p>
    13341334     
    1335       </p></td><td class="auto-generated"> </td></tr></tbody></table></div><div class="table"><a id="id3053768"></a><p class="title"><b>Table 9.4. 
     1335      </p></td><td class="auto-generated"> </td></tr></tbody></table></div><div class="table"><a id="id3020371"></a><p class="title"><b>Table 9.4. 
    13361336  CBC Messages Passed At or Above Log Level 3
    13371337  </b></p><table summary="&#10;  CBC Messages Passed At or Above Log Level 3&#10;  " border="0"><colgroup><col /><col /><col /><col /></colgroup><thead><tr><th align="center">
     
    13511351      </tt></td><td class="auto-generated"> </td></tr><tr><td colspan="2"> </td><td align="left"><p>
    13521352     
    1353       </p></td><td class="auto-generated"> </td></tr></tbody></table></div></div><div class="appendix" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title"><a id="id3055917"></a>Appendix A. FAQ</h2></div></div><div></div></div><div class="qandaset"><table border="0" summary="Q and A Set"><col align="left" width="1%" /><tbody><tr class="question"><td align="left" valign="top"><a id="id3055281"></a><a id="id3055940"></a><b>Q:. </b></td><td align="left" valign="top"><p>
     1353      </p></td><td class="auto-generated"> </td></tr></tbody></table></div></div><div class="appendix" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title"><a id="id3022520"></a>Appendix A. FAQ</h2></div></div><div></div></div><div class="qandaset"><table border="0" summary="Q and A Set"><col align="left" width="1%" /><tbody><tr class="question"><td align="left" valign="top"><a id="id3021884"></a><a id="id3022543"></a><b>Q:. </b></td><td align="left" valign="top"><p>
    13541354  What is <a href="http://www.coin-or.org/faqs.html#CBC" target="_top">CBC</a>?
    13551355  </p></td></tr><tr class="answer"><td align="left" valign="top"><b>A:. </b></td><td align="left" valign="top"><p>
     
    13601360  library (though a rudimentary stand-alone executable exists).
    13611361  The first documented release was .90.0  The current release is version .90.0. (JF 04/01/05)
    1362   </p></td></tr><tr class="question"><td align="left" valign="top"><a id="id3055996"></a><a id="id3055999"></a><b>Q:. </b></td><td align="left" valign="top"><p>
     1362  </p></td></tr><tr class="question"><td align="left" valign="top"><a id="id3022599"></a><a id="id3022602"></a><b>Q:. </b></td><td align="left" valign="top"><p>
    13631363  What are some of the features of CBC?
    13641364  </p></td></tr><tr class="answer"><td align="left" valign="top"><b>A:. </b></td><td align="left" valign="top"><p>
    13651365  CBC allows the use of any CGL cuts and the use of heuristics and
    13661366   specialized branching methods. (JF 04/01/05)
    1367   </p></td></tr><tr class="question"><td align="left" valign="top"><a id="id3056934"></a><a id="id3056937"></a><b>Q:. </b></td><td align="left" valign="top"><p>
     1367  </p></td></tr><tr class="question"><td align="left" valign="top"><a id="id3023538"></a><a id="id3023541"></a><b>Q:. </b></td><td align="left" valign="top"><p>
    13681368  How do I obtain and install CBC?
    13691369  </p></td></tr><tr class="answer"><td align="left" valign="top"><b>A:. </b></td><td align="left" valign="top"><p>
     
    13751375  <a href="http://www.coin-or.org/faqs.html#BuildCode" target="_top">install</a>
    13761376  COIN-OR modules. (JF 04/01/05)
    1377   </p></td></tr><tr class="question"><td align="left" valign="top"><a id="id3056984"></a><a id="id3056987"></a><b>Q:. </b></td><td align="left" valign="top"><p>
     1377  </p></td></tr><tr class="question"><td align="left" valign="top"><a id="id3023587"></a><a id="id3023590"></a><b>Q:. </b></td><td align="left" valign="top"><p>
    13781378  Is CBC reliable?
    13791379  </p></td></tr><tr class="answer"><td align="left" valign="top"><b>A:. </b></td><td align="left" valign="top"><p>
    13801380  CBC has been tested on many problems,
    13811381  but more testing and improvement is needed before it can get to version 1.0. (JF 04/01/05)
    1382   </p></td></tr><tr class="question"><td align="left" valign="top"><a id="id3057009"></a><a id="id3057012"></a><b>Q:. </b></td><td align="left" valign="top"><p>
     1382  </p></td></tr><tr class="question"><td align="left" valign="top"><a id="id3023613"></a><a id="id3023616"></a><b>Q:. </b></td><td align="left" valign="top"><p>
    13831383  Is there any documentation for CBC? 
    13841384  </p></td></tr><tr class="answer"><td align="left" valign="top"><b>A:. </b></td><td align="left" valign="top"><p>
     
    13871387  <a href="http://www.coin-or.org/Doxygen/Cbc/" target="_top">CBC class descriptions</a> generated
    13881388  by <a href="http://www.doxygen.org" target="_top">Doxygen</a>. (JF 04/01/05)
    1389   </p></td></tr><tr class="question"><td align="left" valign="top"><a id="id3057051"></a><a id="id3057054"></a><b>Q:. </b></td><td align="left" valign="top"><p>
     1389  </p></td></tr><tr class="question"><td align="left" valign="top"><a id="id3023654"></a><a id="id3023657"></a><b>Q:. </b></td><td align="left" valign="top"><p>
    13901390  Is CBC as fast as Cplex or Xpress?
    13911391  </p></td></tr><tr class="answer"><td align="left" valign="top"><b>A:. </b></td><td align="left" valign="top"><p>
    13921392   No. However its design is much more flexible so advanced users
    13931393   will be able to tailor CBC to their needs. (JF 04/01/05)
    1394   </p></td></tr><tr class="question"><td align="left" valign="top"><a id="id3057077"></a><a id="id3057080"></a><b>Q:. </b></td><td align="left" valign="top"><p>
     1394  </p></td></tr><tr class="question"><td align="left" valign="top"><a id="id3023680"></a><a id="id3023683"></a><b>Q:. </b></td><td align="left" valign="top"><p>
    13951395  When will version 1.0 of CBC be available? 
    13961396  </p></td></tr><tr class="answer"><td align="left" valign="top"><b>A:. </b></td><td align="left" valign="top"><p>
    13971397  It is expected that version 1.0 will be released in time for the 2005
    13981398  <a href="http://www.informs.org" target="_top">INFORMS</a> annual meeting. (JF 04/01/05)
    1399   </p></td></tr><tr class="question"><td align="left" valign="top"><a id="id3057110"></a><a id="id3057113"></a><b>Q:. </b></td><td align="left" valign="top"><p>
     1399  </p></td></tr><tr class="question"><td align="left" valign="top"><a id="id3023713"></a><a id="id3023716"></a><b>Q:. </b></td><td align="left" valign="top"><p>
    14001400  What can the community do to help?
    14011401  </p></td></tr><tr class="answer"><td align="left" valign="top"><b>A:. </b></td><td align="left" valign="top"><p>
     
    14251425<tt class="filename">COIN/Cbc/Doc/html</tt>.  The same can be done for
    14261426the COIN core, from the <tt class="filename">COIN/Coin</tt> directory.
    1427 </p></div><div class="appendix" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title"><a id="id3055667"></a>Appendix C. Revision History</h2></div></div><div></div></div><div class="revhistory"><table border="0" width="100%" summary="Revision history"><tr><th align="left" valign="top" colspan="3"><b>Revision History</b></th></tr><tr><td align="left">Revision 0.21</td><td align="left">May 10, 2005</td><td align="left">RLH</td></tr><tr><td align="left" colspan="3">Fixed typos caught by Cole Smith, editor of the INFORMS Tutorial Book, and added place holders for needs-to-be-written sections, e.g., Using CGL with CBC.</td></tr><tr><td align="left">Revision 0.2</td><td align="left">May 2, 2005</td><td align="left">RLH</td></tr><tr><td align="left" colspan="3">Book chapter for CBC Tutorial at INFORMS 2005 annual meeting. Reorganized the content. Added CBC Messages. Changed the font type to distinguish functions/variables/classnames/code from text.</td></tr><tr><td align="left">Revision 0.1</td><td align="left">April 1, 2005</td><td align="left">JF</td></tr><tr><td align="left" colspan="3">First draft. The CBC documentation uses the DocBook CLP documentation created by David de la Nuez.</td></tr></table></div></div></div></body></html>
     1427</p></div><div class="appendix" lang="en" xml:lang="en"><div class="titlepage"><div><div><h2 class="title"><a id="id3022271"></a>Appendix C. Revision History</h2></div></div><div></div></div><div class="revhistory"><table border="0" width="100%" summary="Revision history"><tr><th align="left" valign="top" colspan="3"><b>Revision History</b></th></tr><tr><td align="left">Revision 0.21</td><td align="left">May 10, 2005</td><td align="left">RLH</td></tr><tr><td align="left" colspan="3">Fixed typos caught by Cole Smith, editor of the INFORMS Tutorial Book, and added place holders for needs-to-be-written sections, e.g., Using CGL with CBC.</td></tr><tr><td align="left">Revision 0.2</td><td align="left">May 2, 2005</td><td align="left">RLH</td></tr><tr><td align="left" colspan="3">Book chapter for CBC Tutorial at INFORMS 2005 annual meeting. Reorganized the content. Added CBC Messages. Changed the font type to distinguish functions/variables/classnames/code from text.</td></tr><tr><td align="left">Revision 0.1</td><td align="left">April 1, 2005</td><td align="left">JF</td></tr><tr><td align="left" colspan="3">First draft. The CBC documentation uses the DocBook CLP documentation created by David de la Nuez.</td></tr></table></div></div></div></body></html>
  • html/trunk/Cbc/ch01.html

    r557 r558  
    66  </th></tr><tr><td width="20%" align="left"><a accesskey="p" href="index.html">Prev</a> </td><th width="60%" align="center"> </th><td width="20%" align="right"> <a accesskey="n" href="ch01s02.html">Next</a></td></tr></table><hr/></div><div class="chapter" lang="en"><div class="titlepage"><div><div><h2 class="title"><a id="intro"/>Chapter 1. 
    77    Introduction
    8   </h2></div></div><div/></div><div class="toc"><p><b>Table of Contents</b></p><dl><dt><a href="ch01.html#id3165529">
     8  </h2></div></div><div/></div><div class="toc"><p><b>Table of Contents</b></p><dl><dt><a href="ch01.html#id2904645">
    99  Welcome to CBC
    1010  </a></dt><dt><a href="ch01s02.html">
     
    1212  </a></dt><dt><a href="ch01s03.html">Preliminaries</a></dt><dt><a href="ch01s04.html">
    1313Branch-and-Cut Overview
    14 </a></dt></dl></div><div class="section" lang="en"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="id3165529"/>
     14</a></dt></dl></div><div class="section" lang="en"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="id2904645"/>
    1515  Welcome to CBC
    1616  </h2></div></div><div/></div><p>
    1717  The COIN
    18     <sup>[<a id="id3221690" href="#ftn.id3221690">1</a>]</sup>
     18    <sup>[<a id="id2960806" href="#ftn.id2960806">1</a>]</sup>
    1919Branch and Cut solver (CBC) is an open-source mixed-integer program (MIP) solver written  in C++. CBC is intended to be used primarily as a callable library to create customized branch-and-cut solvers. A basic, stand-alone  executable version is also available. CBC is an active open-source project led by John Forrest at www.coin-or.org.
    20  </p></div><div class="footnotes"><br/><hr width="100" align="left"/><div class="footnote"><p><sup>[<a id="ftn.id3221690" href="#id3221690">1</a>] </sup>
     20 </p></div><div class="footnotes"><br/><hr width="100" align="left"/><div class="footnote"><p><sup>[<a id="ftn.id2960806" href="#id2960806">1</a>] </sup>
    2121        The complete acronym is "COIN-OR" which stands for the Compuational Infrastructure for Operations Research. For simplicity (and in keeping with the directory and function names) we will simply use "COIN".
    2222        </p></div></div></div><div class="navfooter"><hr/><table width="100%" summary="Navigation footer"><tr><td width="40%" align="left"><a accesskey="p" href="index.html">Prev</a> </td><td width="20%" align="center"><a accesskey="u" href="index.html">Up</a></td><td width="40%" align="right"> <a accesskey="n" href="ch01s02.html">Next</a></td></tr><tr><td width="40%" align="left" valign="top">CBC User Guide </td><td width="20%" align="center"><a accesskey="h" href="index.html">Home</a></td><td width="40%" align="right" valign="top"> 
  • html/trunk/Cbc/ch01s02.html

    r557 r558  
    66  </th></tr><tr><td width="20%" align="left"><a accesskey="p" href="ch01.html">Prev</a> </td><th width="60%" align="center">Chapter 1. 
    77    Introduction
    8   </th><td width="20%" align="right"> <a accesskey="n" href="ch01s03.html">Next</a></td></tr></table><hr/></div><div class="section" lang="en"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="id3221650"/>
     8  </th><td width="20%" align="right"> <a accesskey="n" href="ch01s03.html">Next</a></td></tr></table><hr/></div><div class="section" lang="en"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="id2960767"/>
    99  Prerequisites
    1010  </h2></div></div><div/></div><p>
  • html/trunk/Cbc/ch01s03.html

    r557 r558  
    22<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Preliminaries</title><meta name="generator" content="DocBook XSL Stylesheets V1.61.2"/><link rel="home" href="index.html" title="CBC User Guide"/><link rel="up" href="ch01.html" title="Chapter 1. &#10;    Introduction&#10;  "/><link rel="previous" href="ch01s02.html" title="&#10;  Prerequisites&#10;  "/><link rel="next" href="ch01s04.html" title="&#10;Branch-and-Cut Overview&#10;"/></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Preliminaries</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="ch01s02.html">Prev</a> </td><th width="60%" align="center">Chapter 1. 
    33    Introduction
    4   </th><td width="20%" align="right"> <a accesskey="n" href="ch01s04.html">Next</a></td></tr></table><hr/></div><div class="section" lang="en"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="id3165821"/>Preliminaries</h2></div></div><div/></div><p>
     4  </th><td width="20%" align="right"> <a accesskey="n" href="ch01s04.html">Next</a></td></tr></table><hr/></div><div class="section" lang="en"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="id2904938"/>Preliminaries</h2></div></div><div/></div><p>
    55  </p><div class="itemizedlist"><ul type="disc"><li>Unless otherwise stated, the problem being optimized is a minimization problem. </li><li>The terms "model" and "problem" are used synonymously.</li><li>Notation: We use the convention of appending an underscore to
    66              a variable in order to distinguish member data of a class.</li><li>The Cbc Samples directory, <tt class="filename">COIN/Cbc/Samples</tt>
  • html/trunk/Cbc/ch01s04.html

    r557 r558  
    66</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="ch01s03.html">Prev</a> </td><th width="60%" align="center">Chapter 1. 
    77    Introduction
    8   </th><td width="20%" align="right"> <a accesskey="n" href="ch02.html">Next</a></td></tr></table><hr/></div><div class="section" lang="en"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="id3236658"/>
     8  </th><td width="20%" align="right"> <a accesskey="n" href="ch02.html">Next</a></td></tr></table><hr/></div><div class="section" lang="en"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="id2975775"/>
    99Branch-and-Cut Overview
    1010</h2></div></div><div/></div><p>
     
    1414 </p><p> 
    1515Step 2. (Branch) Otherwise, there exists an "integer" variable with a non-integral value. Choose one non-integral variable (e.g., with value 1.3) (A)(B) and branch. Create two
    16 <sup>[<a id="id3236826" href="#ftn.id3236826">2</a>]</sup>
     16<sup>[<a id="id2975942" href="#ftn.id2975942">2</a>]</sup>
    1717nodes, one with the branching variable having an upper bound of 1.0, and the other with the branching variable having a lower bound of 2.0. Add the two nodes to the search tree.
    1818 </p><p>
     
    8787  behavior of the source code, the comments in the header files, found in
    8888  <tt class="filename">COIN/Cbc/include</tt>, are the ultimate reference.
    89   </p><div class="footnotes"><br/><hr width="100" align="left"/><div class="footnote"><p><sup>[<a id="ftn.id3236826" href="#id3236826">2</a>] </sup>
     89  </p><div class="footnotes"><br/><hr width="100" align="left"/><div class="footnote"><p><sup>[<a id="ftn.id2975942" href="#id2975942">2</a>] </sup>
    9090The current implementation of CBC allow two branches to be created. More general number of branches could be implemented.
    9191</p></div></div></div><div class="navfooter"><hr/><table width="100%" summary="Navigation footer"><tr><td width="40%" align="left"><a accesskey="p" href="ch01s03.html">Prev</a> </td><td width="20%" align="center"><a accesskey="u" href="ch01.html">Up</a></td><td width="40%" align="right"> <a accesskey="n" href="ch02.html">Next</a></td></tr><tr><td width="40%" align="left" valign="top">Preliminaries </td><td width="20%" align="center"><a accesskey="h" href="index.html">Home</a></td><td width="40%" align="right" valign="top"> Chapter 2. 
  • html/trunk/Cbc/ch02s04.html

    r557 r558  
    1717  </p><p>
    1818  In addition to these <tt class="classname">CbcModel</tt> methods, solution values can be accessed via OSI methods.  The OSI methods pick up the current solution in the <tt class="classname">CBCModel</tt>.  The current solution will match the best solution found so far if called after <tt class="function">branchAndBound()</tt> and a solution was found.
    19   </p><div class="table"><a id="id3238631"/><p class="title"><b>Table 2.1. 
     19  </p><div class="table"><a id="id2977748"/><p class="title"><b>Table 2.1. 
    2020  Methods for Getting Solution Information from OSI
    2121  </b></p><table summary="&#10;  Methods for Getting Solution Information from OSI &#10;  " border="0"><colgroup><col/><col/></colgroup><thead><tr><th>
  • html/trunk/Cbc/ch02s05.html

    r557 r558  
    2222      possible solution is less than this <i class="parameter"><tt>value</tt></i>, or as a percentage, or a fraction.
    2323      </td></tr><tr><td align="left" valign="top"><tt class="function">void setNumberStrong(double value) </tt><br/><tt class="function">int numberStrong()
    24 <sup>[<a id="id3239366" href="#ftn.id3239366">a</a>]</sup> const </tt></td><td align="left" valign="top">
     24<sup>[<a id="id2978483" href="#ftn.id2978483">a</a>]</sup> const </tt></td><td align="left" valign="top">
    2525      These methods set or get the maximum number of candidates at a node to
    2626      be evaluated for strong branching.
     
    5151      This method returns a pointer to a column copy of matrix stored as a
    5252      <tt class="classname">CoinPackedMatrix</tt> which can be further examined.
    53       </td></tr><tr><td align="left" valign="top"><tt class="function">CoinBigIndex getNumElements() const</tt><sup>[<a id="id3239920" href="#ftn.id3239920">b</a>]</sup></td><td align="left" valign="top">
     53      </td></tr><tr><td align="left" valign="top"><tt class="function">CoinBigIndex getNumElements() const</tt><sup>[<a id="id2979036" href="#ftn.id2979036">b</a>]</sup></td><td align="left" valign="top">
    5454      Returns the number of nonzero elements in the problem matrix.
    5555      </td></tr><tr><td align="left" valign="top"><tt class="function">void setObjSense(double value)</tt><br/><tt class="function">double getObjSense() const</tt></td><td align="left" valign="top">
    5656      These methods set and get the objective sense.  The parameter
    5757      <i class="parameter"><tt>value</tt></i> should be +1 to minimize and -1 to maximize.
    58       </td></tr></tbody><tbody class="footnotes"><tr><td colspan="2"><div class="footnote"><p><sup>[<a id="ftn.id3239366" href="#id3239366">a</a>] </sup>
     58      </td></tr></tbody><tbody class="footnotes"><tr><td colspan="2"><div class="footnote"><p><sup>[<a id="ftn.id2978483" href="#id2978483">a</a>] </sup>
    5959This methods (and some of the other) do not follow the "get" convention. The convention has changed over time and there are still some inconsistencies to be cleaned up.
    60 </p></div><div class="footnote"><p><sup>[<a id="ftn.id3239920" href="#id3239920">b</a>] </sup>
     60</p></div><div class="footnote"><p><sup>[<a id="ftn.id2979036" href="#id2979036">b</a>] </sup>
    6161        <span class="type">CoinBigIndex</span> is a <tt class="function">typedef</tt> which in
    6262        most cases is the same as <span class="type">int</span>.
  • html/trunk/Cbc/ch02s06.html

    r557 r558  
    2424
    2525To enable this flexibility,  <tt class="classname">CbcModel</tt> uses other classes in CBC (some of which are virtual and may have multiple instances). Not all classes are created equal. The two tables below list in alphabetical order the classes used by <tt class="classname">CbcModel</tt> that are of most interest and of least interest.
    26 </p><div class="table"><a id="id3240115"/><p class="title"><b>Table 2.3. Classes Used by CbcModel - Most Useful</b></p><table summary="Classes Used by CbcModel - Most Useful" border="0"><colgroup><col/><col/><col/></colgroup><thead><tr><th>
     26</p><div class="table"><a id="id2979231"/><p class="title"><b>Table 2.3. Classes Used by CbcModel - Most Useful</b></p><table summary="Classes Used by CbcModel - Most Useful" border="0"><colgroup><col/><col/><col/></colgroup><thead><tr><th>
    2727    Class name
    2828    </th><th>
  • html/trunk/Cbc/ch03.html

    r557 r558  
    3939       Depth of the node in the search tree.
    4040      </td></tr><tr><td align="left" valign="top"><tt class="function">double guessedObjectiveValue() const</tt></td><td align="left" valign="top">
    41      If user was setting this (e.g., if using pseudo costs).
     41     Displays the guessed objective value, if the user was setting this (e.g., if using pseudo costs).
    4242      </td></tr><tr><td align="left" valign="top"><tt class="function">int way() const</tt></td><td align="left" valign="top">
    4343       The way which branching would next occur from this node
  • html/trunk/Cbc/ch04.html

    r557 r558  
    3030                                              double * betterSolution)</tt>.
    3131  The <tt class="function">solution()</tt> method returns 0 if no solution found, and returns 1 if a solution is found, in which case it fills in the objective value and primal solution.  The code in <tt class="filename">CbcHeuristicGreedy.cpp</tt> is a little more complicated than this following example. For instance, the code here assumes all variables are integer.  The important bit of data is a copy of the matrix (stored by column) before any cuts have been made.  The data used are bounds, objective and the matrix plus two work arrays.
    32   </p><div class="example"><a id="id3244936"/><p class="title"><b>Example 4.1. Data</b></p><pre class="programlisting">
     32  </p><div class="example"><a id="id2984053"/><p class="title"><b>Example 4.1. Data</b></p><pre class="programlisting">
    3333   
    3434  OsiSolverInterface * solver = model_-&gt;solver(); // Get solver from CbcModel
     
    5656  </pre></div><p>
    5757The <tt class="varname">newSolution</tt> is then initialized to the rounded down solution.
    58 </p><div class="example"><a id="id3244965"/><p class="title"><b>Example 4.2. Initialize <tt class="varname">newSolution</tt></b></p><pre class="programlisting">
     58</p><div class="example"><a id="id2984082"/><p class="title"><b>Example 4.2. Initialize <tt class="varname">newSolution</tt></b></p><pre class="programlisting">
    5959   
    6060  for (iColumn=0;iColumn&lt;numberColumns;iColumn++) {
     
    8383
    8484At this point some row activities are below their lower bound. To correct the infeasibility, the variable which is cheapest in reducing the sum of infeasibilities is found and updated, and the process repeats.  This is a finite process. (The implementation could be faster, but is kept simple for illustrative purposes.)
    85   </p><div class="example"><a id="id3245045"/><p class="title"><b>Example 4.3. Create Feasible <tt class="varname">newSolution</tt> from Initial <tt class="varname">newSolution</tt></b></p><pre class="programlisting">
     85  </p><div class="example"><a id="id2984162"/><p class="title"><b>Example 4.3. Create Feasible <tt class="varname">newSolution</tt> from Initial <tt class="varname">newSolution</tt></b></p><pre class="programlisting">
    8686   
    8787  while (true) {
     
    130130  </pre></div><p>
    131131A solution value of <tt class="varname">newSolution</tt> is compared to the best solution value. If <tt class="varname">newSolution</tt> is an improvement, its feasibility is validated. We expect <tt class="varname">newSolution</tt> to be feasible, and are trapping for unexpected numerical errors.
    132   </p><div class="example"><a id="id3245090"/><p class="title"><b>Example 4.4. Check Solution Quality of <tt class="varname">newSolution</tt></b></p><pre class="programlisting">
     132  </p><div class="example"><a id="id2984207"/><p class="title"><b>Example 4.4. Check Solution Quality of <tt class="varname">newSolution</tt></b></p><pre class="programlisting">
    133133   
    134134  returnCode=0; // 0 means no good solution
  • html/trunk/Cbc/ch05s03.html

    r557 r558  
    1818variables are left which may be necessary if other sorts of constraints exist. Follow-on branching rules are to be considered first, so the priorities are set to indicate the follow-on rules take precedence. Priority 1 is the highest priority.
    1919
    20 </p><div class="example"><a id="id3245459"/><p class="title"><b>Example 5.2. <tt class="classname">CbcFollowOn</tt></b></p><pre class="programlisting">
     20</p><div class="example"><a id="id2984576"/><p class="title"><b>Example 5.2. <tt class="classname">CbcFollowOn</tt></b></p><pre class="programlisting">
    2121   
    2222  int iColumn;
  • html/trunk/Cbc/ch07.html

    r557 r558  
    3434a variable was active in a solution.  For the first few solves, the normal Dual Simplex is called and
    3535<tt class="varname">node_</tt> array is updated.
    36 </p><div class="example"><a id="id3245727"/><p class="title"><b>Example 7.2. First Few Solves</b></p><pre class="programlisting">
     36</p><div class="example"><a id="id2984844"/><p class="title"><b>Example 7.2. First Few Solves</b></p><pre class="programlisting">
    3737   
    3838  if (count_&lt;10) {
     
    5555After the first few solves, only those variables which took part in a solution in the last so many
    5656solves are used.  As fast0507 is a set covering problem, any rows which are already covered can be taken out.
    57   </p><div class="example"><a id="id3245755"/><p class="title"><b>Example 7.3. Create Small Sub-Problem</b></p><pre class="programlisting">
     57  </p><div class="example"><a id="id2984872"/><p class="title"><b>Example 7.3. Create Small Sub-Problem</b></p><pre class="programlisting">
    5858   
    5959    int * whichRow = new int[numberRows]; // Array to say which rows used
     
    151151If the variables cover the rows, then the problem is feasible (no cuts are being used). (If the rows
    152152were equality constraints, then this might not be the case. More work would be needed.)  After the solution to the subproblem, the reduced costs of the full problem are checked. If the reduced cost of any variable not in the subproblem is negative, the code goes back to the full problem and cleans up with Primal Simplex.
    153   </p><div class="example"><a id="id3245801"/><p class="title"><b>Example 7.4. Check Optimal Solution</b></p><pre class="programlisting">
     153  </p><div class="example"><a id="id2984918"/><p class="title"><b>Example 7.4. Check Optimal Solution</b></p><pre class="programlisting">
    154154   
    155155    temp-&gt;setDualObjectiveLimit(1.0e50); // Switch off dual cutoff as problem is restricted
  • html/trunk/Cbc/ch07s02.html

    r557 r558  
    1111More Samples
    1212</i></a>).
    13   </p><div class="example"><a id="id3245867"/><p class="title"><b>Example 7.5. Solving a Quadratic MIP</b></p><pre class="programlisting">
     13  </p><div class="example"><a id="id2984984"/><p class="title"><b>Example 7.5. Solving a Quadratic MIP</b></p><pre class="programlisting">
    1414   
    1515  // save cutoff
  • html/trunk/Cbc/ch08.html

    r557 r558  
    66</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="ch07s02.html">Prev</a> </td><th width="60%" align="center"> </th><td width="20%" align="right"> <a accesskey="n" href="ch09.html">Next</a></td></tr></table><hr/></div><div class="chapter" lang="en"><div class="titlepage"><div><div><h2 class="title"><a id="moreexamples"/>Chapter 8. 
    77More Samples
    8 </h2></div></div><div/></div><div class="toc"><p><b>Table of Contents</b></p><dl><dt><a href="ch08.html#id3247359">CBC's Samples Directory</a></dt></dl></div><div class="section" lang="en"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="id3247359"/>CBC's Samples Directory</h2></div></div><div/></div><p>
     8</h2></div></div><div/></div><div class="toc"><p><b>Table of Contents</b></p><dl><dt><a href="ch08.html#id2986477">CBC's Samples Directory</a></dt></dl></div><div class="section" lang="en"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="id2986477"/>CBC's Samples Directory</h2></div></div><div/></div><p>
    99The CBC distribution includes a number of <tt class="filename">.cpp</tt> sample files.
    1010Users are encouraged to use them as starting points for their own CBC projects.
     
    1414by </p><pre class="programlisting">make DRIVER=name</pre><p> which produces an executable <tt class="filename">testit</tt>.  Below is a list of
    1515some of the most useful sample files with a short description for each file.
    16 </p><div class="table"><a id="id3248316"/><p class="title"><b>Table 8.1. Basic Samples</b></p><table summary="Basic Samples" border="0"><colgroup><col/><col/></colgroup><thead><tr><th align="left" valign="bottom">
     16</p><div class="table"><a id="id2987434"/><p class="title"><b>Table 8.1. Basic Samples</b></p><table summary="Basic Samples" border="0"><colgroup><col/><col/></colgroup><thead><tr><th align="left" valign="bottom">
    1717        Source file       
    1818        </th><th align="left" valign="bottom">
     
    2929        <tt class="function">CbcHeuristicUser.cpp</tt>
    3030        with corresponding <tt class="function">*.hpp</tt> files.
    31         </td></tr></tbody></table></div><div class="table"><a id="id3248490"/><p class="title"><b>Table 8.2. Advanced Samples</b></p><table summary="Advanced Samples" border="0"><colgroup><col/><col/></colgroup><thead><tr><th align="left" valign="bottom">
     31        </td></tr></tbody></table></div><div class="table"><a id="id2987608"/><p class="title"><b>Table 8.2. Advanced Samples</b></p><table summary="Advanced Samples" border="0"><colgroup><col/><col/></colgroup><thead><tr><th align="left" valign="bottom">
    3232        Source file       
    3333        </th><th align="left" valign="bottom">
  • html/trunk/Cbc/ch09.html

    r557 r558  
    2727    </li><li>
    2828    Log Level 3: Tremendous amount of information, e.g., multiple messages per node.
    29     </li></ul></div><div class="table"><a id="id3249793"/><p class="title"><b>Table 9.1. 
     29    </li></ul></div><div class="table"><a id="id2988911"/><p class="title"><b>Table 9.1. 
    3030  CBC Messages Passed At Log Level 0
    3131  </b></p><table summary="&#10;  CBC Messages Passed At Log Level 0&#10;  " border="0"><colgroup><col/><col/><col/><col/></colgroup><thead><tr><th align="center">
     
    3737      </td><td> </td><td align="left"><tt class="computeroutput">No integer variables - nothing to do</tt></td><td class="auto-generated"> </td></tr><tr><td colspan="2"> </td><td align="left"><p>
    3838
    39       </p></td><td class="auto-generated"> </td></tr></tbody></table></div><div class="table"><a id="id3249938"/><p class="title"><b>Table 9.2. 
     39      </p></td><td class="auto-generated"> </td></tr></tbody></table></div><div class="table"><a id="id2989055"/><p class="title"><b>Table 9.2. 
    4040  CBC Messages Passed At or Above Log Level 1
    4141  </b></p><table summary="&#10;  CBC Messages Passed At or Above Log Level 1&#10;  " border="0"><colgroup><col/><col/><col/><col/></colgroup><thead><tr><th align="center">
     
    161161      </tt></td><td class="auto-generated"> </td></tr><tr><td colspan="2"> </td><td align="left"><p>
    162162     
    163       </p></td><td class="auto-generated"> </td></tr></tbody></table></div><div class="table"><a id="id3251301"/><p class="title"><b>Table 9.3. 
     163      </p></td><td class="auto-generated"> </td></tr></tbody></table></div><div class="table"><a id="id2990419"/><p class="title"><b>Table 9.3. 
    164164  CBC Messages Passed At or Above Log Level 2
    165165  </b></p><table summary="&#10;  CBC Messages Passed At or Above Log Level 2&#10;  " border="0"><colgroup><col/><col/><col/><col/></colgroup><thead><tr><th align="center">
     
    191191      </tt></td><td class="auto-generated"> </td></tr><tr><td colspan="2"> </td><td align="left"><p>
    192192     
    193       </p></td><td class="auto-generated"> </td></tr></tbody></table></div><div class="table"><a id="id3251702"/><p class="title"><b>Table 9.4. 
     193      </p></td><td class="auto-generated"> </td></tr></tbody></table></div><div class="table"><a id="id2990820"/><p class="title"><b>Table 9.4. 
    194194  CBC Messages Passed At or Above Log Level 3
    195195  </b></p><table summary="&#10;  CBC Messages Passed At or Above Log Level 3&#10;  " border="0"><colgroup><col/><col/><col/><col/></colgroup><thead><tr><th align="center">
  • html/trunk/Cbc/index.html

    r557 r558  
    2626</div></div></div><div/><hr/></div><div class="toc"><p><b>Table of Contents</b></p><dl><dt>1. <a href="ch01.html">
    2727    Introduction
    28   </a></dt><dd><dl><dt><a href="ch01.html#id3165529">
     28  </a></dt><dd><dl><dt><a href="ch01.html#id2904645">
    2929  Welcome to CBC
    3030  </a></dt><dt><a href="ch01s02.html">
     
    5656</a></dt><dd><dl><dt><a href="ch07.html#solver">Creating a Solver via Inheritance</a></dt><dt><a href="ch07s02.html">Quadratic MIP</a></dt></dl></dd><dt>8. <a href="ch08.html">
    5757More Samples
    58 </a></dt><dd><dl><dt><a href="ch08.html#id3247359">CBC's Samples Directory</a></dt></dl></dd><dt>9. <a href="ch09.html">
     58</a></dt><dd><dl><dt><a href="ch08.html#id2986477">CBC's Samples Directory</a></dt></dl></dd><dt>9. <a href="ch09.html">
    5959  Messages
    60   </a></dt><dt>A. <a href="apa.html">FAQ</a></dt><dt>B. <a href="apb.html">Doxygen</a></dt><dt>C. <a href="apc.html">Revision History</a></dt></dl></div><div class="list-of-tables"><p><b>List of Tables</b></p><dl><dt>1.1. <a href="ch01s04.html#assClasses">Associated Classes</a></dt><dt>2.1. <a href="ch02s04.html#id3238631">
     60  </a></dt><dt>A. <a href="apa.html">FAQ</a></dt><dt>B. <a href="apb.html">Doxygen</a></dt><dt>C. <a href="apc.html">Revision History</a></dt></dl></div><div class="list-of-tables"><p><b>List of Tables</b></p><dl><dt>1.1. <a href="ch01s04.html#assClasses">Associated Classes</a></dt><dt>2.1. <a href="ch02s04.html#id2977748">
    6161  Methods for Getting Solution Information from OSI
    62   </a></dt><dt>2.2. <a href="ch02s05.html#setGet">Useful Set and Get Methods in CbcModel</a></dt><dt>2.3. <a href="ch02s06.html#id3240115">Classes Used by CbcModel - Most Useful</a></dt><dt>2.4. <a href="ch02s06.html#least">Classes Used by CbcModel - Least Useful</a></dt><dt>3.1. <a href="ch03.html#compareTable">Compare Classes Provided</a></dt><dt>3.2. <a href="ch03.html#nodeTable">Information Available from CbcNode</a></dt><dt>8.1. <a href="ch08.html#id3248316">Basic Samples</a></dt><dt>8.2. <a href="ch08.html#id3248490">Advanced Samples</a></dt><dt>9.1. <a href="ch09.html#id3249793">
     62  </a></dt><dt>2.2. <a href="ch02s05.html#setGet">Useful Set and Get Methods in CbcModel</a></dt><dt>2.3. <a href="ch02s06.html#id2979231">Classes Used by CbcModel - Most Useful</a></dt><dt>2.4. <a href="ch02s06.html#least">Classes Used by CbcModel - Least Useful</a></dt><dt>3.1. <a href="ch03.html#compareTable">Compare Classes Provided</a></dt><dt>3.2. <a href="ch03.html#nodeTable">Information Available from CbcNode</a></dt><dt>8.1. <a href="ch08.html#id2987434">Basic Samples</a></dt><dt>8.2. <a href="ch08.html#id2987608">Advanced Samples</a></dt><dt>9.1. <a href="ch09.html#id2988911">
    6363  CBC Messages Passed At Log Level 0
    64   </a></dt><dt>9.2. <a href="ch09.html#id3249938">
     64  </a></dt><dt>9.2. <a href="ch09.html#id2989055">
    6565  CBC Messages Passed At or Above Log Level 1
    66   </a></dt><dt>9.3. <a href="ch09.html#id3251301">
     66  </a></dt><dt>9.3. <a href="ch09.html#id2990419">
    6767  CBC Messages Passed At or Above Log Level 2
    68   </a></dt><dt>9.4. <a href="ch09.html#id3251702">
     68  </a></dt><dt>9.4. <a href="ch09.html#id2990820">
    6969  CBC Messages Passed At or Above Log Level 3
    70   </a></dt></dl></div><div class="list-of-examples"><p><b>List of Examples</b></p><dl><dt>2.1. <a href="ch02s02.html#minimum.cpp">minimum.cpp</a></dt><dt>3.1. <a href="ch03.html#test">CbcCompareUser::test()</a></dt><dt>3.2. <a href="ch03.html#newSolution">CbcCompareUser::newSolution()</a></dt><dt>3.3. <a href="ch03.html#everyK">CbcCompareUser::every1000Nodes()</a></dt><dt>4.1. <a href="ch04.html#id3244936">Data</a></dt><dt>4.2. <a href="ch04.html#id3244965">Initialize newSolution</a></dt><dt>4.3. <a href="ch04.html#id3245045">Create Feasible newSolution from Initial newSolution</a></dt><dt>4.4. <a href="ch04.html#id3245090">Check Solution Quality of newSolution</a></dt><dt>5.1. <a href="ch05s02.html#pseudo">CbcSimpleIntegerPseudoCosts</a></dt><dt>5.2. <a href="ch05s03.html#id3245459">CbcFollowOn</a></dt><dt>7.1. <a href="ch07.html#initialSolve">initialSolve()</a></dt><dt>7.2. <a href="ch07.html#id3245727">First Few Solves</a></dt><dt>7.3. <a href="ch07.html#id3245755">Create Small Sub-Problem</a></dt><dt>7.4. <a href="ch07.html#id3245801">Check Optimal Solution</a></dt><dt>7.5. <a href="ch07s02.html#id3245867">Solving a Quadratic MIP</a></dt></dl></div></div><div class="navfooter"><hr/><table width="100%" summary="Navigation footer"><tr><td width="40%" align="left"> </td><td width="20%" align="center"> </td><td width="40%" align="right"> <a accesskey="n" href="ch01.html">Next</a></td></tr><tr><td width="40%" align="left" valign="top"> </td><td width="20%" align="center"> </td><td width="40%" align="right" valign="top"> Chapter 1. 
     70  </a></dt></dl></div><div class="list-of-examples"><p><b>List of Examples</b></p><dl><dt>2.1. <a href="ch02s02.html#minimum.cpp">minimum.cpp</a></dt><dt>3.1. <a href="ch03.html#test">CbcCompareUser::test()</a></dt><dt>3.2. <a href="ch03.html#newSolution">CbcCompareUser::newSolution()</a></dt><dt>3.3. <a href="ch03.html#everyK">CbcCompareUser::every1000Nodes()</a></dt><dt>4.1. <a href="ch04.html#id2984053">Data</a></dt><dt>4.2. <a href="ch04.html#id2984082">Initialize newSolution</a></dt><dt>4.3. <a href="ch04.html#id2984162">Create Feasible newSolution from Initial newSolution</a></dt><dt>4.4. <a href="ch04.html#id2984207">Check Solution Quality of newSolution</a></dt><dt>5.1. <a href="ch05s02.html#pseudo">CbcSimpleIntegerPseudoCosts</a></dt><dt>5.2. <a href="ch05s03.html#id2984576">CbcFollowOn</a></dt><dt>7.1. <a href="ch07.html#initialSolve">initialSolve()</a></dt><dt>7.2. <a href="ch07.html#id2984844">First Few Solves</a></dt><dt>7.3. <a href="ch07.html#id2984872">Create Small Sub-Problem</a></dt><dt>7.4. <a href="ch07.html#id2984918">Check Optimal Solution</a></dt><dt>7.5. <a href="ch07s02.html#id2984984">Solving a Quadratic MIP</a></dt></dl></div></div><div class="navfooter"><hr/><table width="100%" summary="Navigation footer"><tr><td width="40%" align="left"> </td><td width="20%" align="center"> </td><td width="40%" align="right"> <a accesskey="n" href="ch01.html">Next</a></td></tr><tr><td width="40%" align="left" valign="top"> </td><td width="20%" align="center"> </td><td width="40%" align="right" valign="top"> Chapter 1. 
    7171    Introduction
    7272  </td></tr></table></div></body></html>
Note: See TracChangeset for help on using the changeset viewer.