source: trunk/Docs/moresamples.xml @ 411

Last change on this file since 411 was 408, checked in by ddelanu, 16 years ago

Candidate for User Guide revision 0.3, which is to be the first world-wide release

  • Property svn:eol-style set to native
  • Property svn:keywords set to Author Date Id Revision
File size: 3.0 KB
Line 
1<?xml version="1.0" encoding="ISO-8859-1"?>
2<chapter id="moreexamples">
3<title>
4More Samples
5</title>
6<para>
7CLP includes a number of <filename>.cpp</filename> sample files.  They can be
8found in the <filename>COIN/Clp/Samples</filename> directory.  Below is a table
9listing some of the sample files with a short description for each.
10</para>
11<table frame="none">
12  <title>Contents of the Samples directory</title>
13  <tgroup cols="2">
14    <thead>
15      <row>
16        <entry align="left" valign="bottom">
17        Filename&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;
18        </entry>
19        <entry align="left" valign="bottom">
20        Description
21        </entry>
22      </row>
23    </thead>
24    <tbody>
25      <row>
26        <entry align="left" valign="top">
27        <filename>minimum.cpp</filename>
28        </entry>
29        <entry align="left" valign="top">
30        This is a CLP &lt;Hello, world&gt; program.  It reads an MPS file, and
31        solves the problem.
32        </entry>
33      </row>
34      <row>
35        <entry align="left" valign="top">
36        <filename>defaults.cpp</filename>
37        </entry>
38        <entry align="left" valign="top">
39        This is one of the simpler drivers.  It sets tolerances to defaults and
40        is a useful place to find simple use of &lt;sets&gt; and &lt;gets&gt;.
41        It also prints out a full MPS-like solutions.
42        </entry>
43      </row>
44      <row>
45        <entry align="left" valign="top">
46        <filename>driver.cpp</filename>
47        </entry>
48        <entry align="left" valign="top">
49        This is designed to be the file that people modify to get a useful
50        driver.  It does presolve.
51        </entry>
52      </row>
53      <row>
54        <entry align="left" valign="top">
55        <filename>network.cpp</filename>
56        </entry>
57        <entry align="left" valign="top">
58        This shows the use of non-standard matrices and how to load a problem
59        without going throu MPS files.
60        </entry>
61      </row>
62      <row>
63        <entry align="left" valign="top">
64        <filename>decompose.cpp</filename>
65        </entry>
66        <entry align="left" valign="top">
67        This does full Dantzig-Wolfe decomposition.  It illustrates
68        the use of many models, adding columns, et cetera.
69        </entry>
70      </row>
71      <row>
72        <entry align="left" valign="top">
73        <filename>sprint.cpp</filename>
74        </entry>
75        <entry align="left" valign="top">
76        This solves a long, thin problem by solving smaller subsets.  It is a
77        simplified version of work done by one of the authors on aircrew
78        scheduling problems.  It shows the use of two models and their
79        synchronization.  A more general version can be found in
80        <filename>COIN/Clp/ClpSolve.cpp</filename>
81        </entry>
82      </row>
83      <row>
84        <entry align="left" valign="top">
85        <filename>sprint2.cpp</filename>
86        </entry>
87        <entry align="left" valign="top">
88        This is similar to <filename>sprint.cpp</filename> but is designed for
89        solving large problems with little choice.  The idea is that if
90        relatively few variables are fixed, presolve can greatly reduce the
91        problem size so that a series of solves can get close to the optimal
92        solution much faster than would a na&iuml;ve solve of the full problem.
93        </entry>
94      </row>
95    </tbody>
96  </tgroup>
97</table>
98</chapter>
Note: See TracBrowser for help on using the repository browser.