source: trunk/Cbc/README

Last change on this file was 2292, checked in by tkr, 20 months ago

Adding download links to bintray

  • Property svn:eol-style set to native
  • Property svn:keywords set to Author Date Id Revision
File size: 9.9 KB
Line 
1# CBC Version 2.9.4 README
2
3Welcome to the README for the COIN Branch and Cut Solver (CBC). CBC is
4distributed under the Eclipse Public License and is freely redistributable.
5All source code and documentation is Copyright IBM and others. This README may
6be redistributed freely.
7
8## DOWNLOAD
9
10Binaries for most platforms are available for download from [Bintray](https://bintray.com/coin-or/download/Cbc)
11
12## DOCUMENTATION
13
14For a quick start guide, please see the INSTALL file in this distribution. A
15(somehwat outdated) user's manual is available here:
16
17http://www.coin-or.org/Cbc
18
19More up-to-date automatically generated documentation of the source code can
20be found here:
21
22http://www.coin-or.org/Doxygen/Cbc/
23
24Further information can be found here:
25
26http://projects.coin-or.org/Cbc
27
28## SUPPORT
29
30### List Serve
31
32CBC users should use the Cbc mailing list. To subscribe, go to
33http://list.coin-or.org/mailman/listinfo/cbc
34
35### Bug Reports
36
37Bug reports should be reported on the CBC development web site at
38
39https://projects.coin-or.org/Cbc/newticket
40
41## CHANGELOG
42
43 * Release 2.9.8
44
45   * Update to most current releases of dependencies
46   * Small bug fixes
47   * Add support for automatic build and test with Travis and Appveyor
48
49* Release 2.9.7
50
51   * Small bug fixes
52   * Option to switch to line buffered output
53
54 * Release 2.9.6
55
56   * Small bug fixes
57
58 * Release 2.9.5
59
60   * Small bug fixes
61
62 * Release 2.9.4
63
64   * Small fixes for stability
65   * Fixes for Doygen documentation generation
66
67 * Release 2.9.3
68
69   * Minor bug fixes
70
71 * Release 2.9.2
72
73   * Fix for proper installation with ```DESTDIR```
74
75 * Release 2.9.1
76
77   * Fix for dependency linking
78   * Minor bug fixes
79
80 * Release 2.9.0
81
82   * Introduced specialized branching methods for dealing with "big Ms".
83   * Introduced new methods for dealing with symmetry (requires installation of [nauty](http://pallini.di.uniroma1.it/))
84   * Introduction of conflict cuts (off by default, turn on with `-constraint conflict`)
85
86 * Release 2.8.13
87
88   * Improved message handling
89   * Miscellaneous bug fixes.
90
91 * Release 2.8.12
92   * Update for dependencies.
93
94 * Release 5.8.11
95
96   * Major overhaul of C interface
97   * Fixes to SOS
98   * Miscellaneous bug fixes
99
100 * Release 2.8.10
101
102   * More changes related to thread safety.
103   * Fix bug in build system with Visual Studio compiler.
104   * Miscellaneous bug fixes.
105
106 * Release 2.8.9
107
108   * Attempt to make Cbc thread safe.
109   * Add parallel examples.
110   * Add CbcSolverUsefulInfo.
111   * Bug fixes.
112
113 * Release 2.8.8
114
115   * Added example to show how to use Cbc with installed libraries in MSVC++
116   * Fixed inconsistency in addition of libCbcSolver to dependencies in
117     {{{cbc_addlibs.txt}}}.
118
119 * Release 2.8.7
120
121   * Changed so that Doxygen builds LaTex
122   * Fixes for build system
123
124 * Release 2.8.6
125
126   * Added option to explicitly link dependencies to comply with packaging
127     requirements on Fedora and Debian, as well as allow building of MinGW
128     DLLs.
129
130 * Release 2.8.5
131
132   * Minor fixes to build system
133
134 * Release 2.8.4
135   * Small bug fixes
136   * Upgrades to build system
137
138 * Release 2.8.3:
139
140   * Fix for handling SOS.
141
142 * Release 2.8.2:
143
144   * Fixed recognition of Glpk source in main configure.
145   * Minor bug fixes in CoinUtils, Clp, and Cbc.
146
147 * Release 2.8.1:
148
149   * Minor bug fixes
150
151 * Release 2.8.0:
152
153   * Introduced new secondaryStatus 8 to indicate that solving stopped due to
154     an iteration limit.
155   * Solution pool is now accessible via the command line and the CbcMain*
156     interface.
157   * New mipstart option to read an initial feasible solution from a file.
158     Only values for discrete variables need to be provided.
159
160   * Added Proximity Search heuristic by Fischetti and Monaci (off by
161     default): The simplest way to switch it on using stand-alone version is
162     ```-proximity on```.
163
164     Proximity Search is the new "No-Neighborhood Search" 0-1 MIP refinement
165     heuristic recently proposed by Fischetti and Monaci (2012). The idea is
166     to define a sub-MIP without additional constraints but with a modified
167     objective function intended to attract the search in the proximity of the
168     incumbent. The approach works well for 0-1 MIPs whose solution landscape
169     is not too irregular (meaning the there is reasonable probability of
170     finding an improved solution by flipping a small number of binary
171     variables), in particular when it is applied to the first heuristic
172     solutions found at the root node.
173   
174   * An implementation of Zero-Half-Cuts by Alberto Caprara is now available.
175     By default, these cuts are off. To use add to your command line
176     -zerohalfCuts root (or other options) or just -zero. So far, they may
177     help only on a small subset of problems and may need some tuning.
178
179     The implementation of these cuts is described in G. Andreello, A.
180     Caprara, and M. Fischetti "Embedding Cuts in a Branch and Cut Framework:
181     a Computational Study with {0,1/2}-Cuts" INFORMS Journal on Computing
182     19(2), 229-238, 2007 http://dx.doi.org/10.1287/ijoc.1050.0162
183
184   * An alternative implementation of a reduce and split cut generator by
185     Giacomo Nannicini is now available. By default, these cuts are off. To
186     use add to your command line -reduce2AndSplitCuts root (or other
187     options).
188
189     The implementation of these cuts is described in G. Cornuejols and G.
190     Nannicini "Practical strategies for generating rank-1 split cuts in
191     mixed-integer linear programming" Mathematical Programming Computation
192     3(4), 281-318, 2011 http://dx.doi.org/10.1007/s12532-011-0028-6
193
194   * An alternative robust implementation of a Gomory cut generator by Giacomo
195     Nannicini is now available. By default, these cuts are off. To use add to
196     your command line -GMI root (or other options).
197
198     The implementation of these cuts is described in G. Cornuejols, F.
199     Margot, and G. Nannicini "On the safety of Gomory cut generators"
200     http://faculty.sutd.edu.sg/~nannicini/index.php?page=publications
201
202   * To encourage the use of some of the more exotic/expensive cut generators
203     a parameter -slowcutpasses has been added. The idea is that the code does
204     these cuts just a few times - less than the more usual cuts. The default
205     is 10. The cut generators identified by "may be slow" at present are just
206     Lift and project and ReduceAndSplit (both versions).
207   
208   * Allow initialization of random seed by user. Pseudo-random numbers are
209     used in Cbc and Clp. In Clp they are used to break ties in degenerate
210     problems, while in Cbc heuristics such as the Feasibility Pump use them
211     to decide whether to round up or down. So if a different pseudo-random
212     seed is given to Clp then you may get a different continuous optimum and
213     so different cuts and heuristic solutions. This can be switched on by
214     setting randomSeed for Clp and/or randomCbcSeed for Cbc. The special
215     value of 0 tells code to use time of day for initial seed.
216   
217   * Building on this idea, Andrea Lodi, Matteo Fischetti, Michele Monaci,
218     Domenico Salvagnin, Yuji Shinano, and Andrea Tramontani suggest that this
219     idea be improved by running at the root node with multiple copies of
220     solver, each with its own different seed and then passing in the
221     solutions and cuts so that the main solver has a richer set of solutions
222     and possibly stronger cuts. This is switched on by setting
223     -multipleRootPasses. These can also be done in parallel.
224 
225   * Few changes to presolve for special variables and badly scaled problems
226     (in CoinUtils).
227
228   * New option -extraVariables <number> which switches on a trivial
229    re-formulation that introduces extra integer variables to group together
230    variables with same cost.
231
232   * For some problems, cut generators and general branching work better if
233     the problem would be infeasible if the cost is too high. If the new
234     option -constraintFromCutoff is set, the objective function is added as a
235     constraint which rhs is set to the current cutoff value (objective value
236     of best known solution).
237
238 * Release 2.7.8:
239
240   * Change message when LP simplex iteration limit is hit from "Exiting on
241     maximum nodes" to "Exiting on maximum number of iterations"
242   * Fix for using overlapping SOS.
243   * Fixes in buildsystem.
244
245 * Release 2.7.7:
246
247   * Fix to report interruption on user event if SIGINT is received by
248     CbcSolver. model->status() should now be 5 if this event happened. Added
249     method CbcModel::sayEventHappened() to make cbc stop due to an 'user
250     event'.
251
252   * Other minor fixes.
253
254 * Release 2.7.6:
255
256   * Fixes to build system.
257
258   * Other minor fixes.
259
260 * Release 2.7.5:
261
262   * Fixes to get AMPL interface working again.
263
264   * More fixes to MSVC++ files.
265
266 * Release 2.7.4:
267
268   * Minor bugfixes.
269
270 * Release 2.7.3:
271
272   * Minor bugfixes.
273
274   * Fixes to MSVC++ files.
275
276 * Release 2.7.2:
277
278   * Allow row/column names for GMPL models.
279
280   * Added CbcModel::haveMultiThreadSupport() to indicate whether Cbc library
281     has been compiled with multithread support.
282
283   * Added CbcModel::waitingForMiniBranchAndBound() to indicate whether
284     sub-MIP heuristic is currently running.
285
286   * Cbc shell should work with readline if configured with
287     ```--enable-gnu-packages```.
288
289   * Support for compressed input files (.gz, .bz2) is now enabled by default.
290
291   * Fix problems with relative gap tolerance > 100% and further bugs.
292
293   * Fixes for MSVC++ Version 9 files.
294
295   * Minor fixes in buildsystem; update to BuildTools 0.7.1.
296
297 * Release 2.7.1:
298
299   * Fixes to MSVC++ files
300
301 * Release 2.7.0:
302
303   * License has been changed to the EPL.
304
305   * Support for MSVC++ version 10 added.
306
307   * Support for BuildTools version 0.7 to incorporate recent enhancements,
308     including proper library versioning in Linux, prohibiting installation of
309     private headers, etc.
310
311   * Updated externals to new stable versions of dependent projects.
312
313   * Improvements to heuristics.
314
315   * New options for cut generation.
316
317   * Improved reporting of results.
318
319   * Improvements to documentation.
320
321   * Minor bug fixes.
322
323
Note: See TracBrowser for help on using the repository browser.