source: stable/2.8/Cbc/README @ 1902

Last change on this file since 1902 was 1902, checked in by stefan, 6 years ago

sync with trunk rev 1901

  • Property svn:eol-style set to native
  • Property svn:keywords set to Author Date Id Revision
File size: 8.4 KB
RevLine 
[1690]1CBC README
2==========
[353]3
[1690]4Welcome to the README for the COIN Branch and Cut Solver (CBC). CBC is
5distributed under the Eclipse Public License and is freely redistributable.
6All source code and documentation is Copyright IBM and others. This README may
7be redistributed freely.
[2]8
[1690]9DOCUMENTATION
10=============
[2]11
[1690]12For a quick start guide, please see the INSTALL file in this distribution. A (somehwat outdated) user's manual is available here:
[2]13
[1690]14http://www.coin-or.org/Cbc
[237]15
[1690]16More up-to-date automatically generated documentation of the source code can
17be found here:
[237]18
[1690]19http://www.coin-or.org/Doxygen/Cbc/
[237]20
[1690]21Further information can be found here:
[237]22
[1690]23http://projects.coin-or.org/Cbc
[237]24
[1690]25WHAT'S NEW
26==========
[237]27
[1888]28Release 2.8.0:
[1792]29
301. Introduced new secondaryStatus 8 to indicate that solving stopped due to an iteration limit.
31
[1828]322. Solution pool is now accessible via the command line and the CbcMain* interface.
[1792]33
[1825]343. New mipstart option to read an initial feasible solution from a file. Only values for discrete
35   variables need to be provided.
[1792]36
[1803]374. Added Proximity Search heuristic by Fischetti and Monaci (off by default):
38   The simplest way to switch it on using stand-alone version is "-proximity on".
39
40   Proximity Search is the new "No-Neighborhood Search" 0-1 MIP refinement heuristic recently proposed by
41   Fischetti and Monaci (2012). The idea is to define a sub-MIP without additional constraints but with a
42   modified objective function intended to attract the search in the proximity of the incumbent. The approach
43   works well for 0-1 MIPs whose solution landscape is not too irregular (meaning the there is reasonable
44   probability of finding an improved solution by flipping a small number of binary variables), in particular
45   when it is applied to the first heuristic solutions found at the root node.
[1888]46   
[1848]475. An implementation of Zero-Half-Cuts by Alberto Caprara is now available.
48   By default, these cuts are off.  To use add to your command line -zerohalfCuts root (or other options) or just -zero.
49   So far, they may help only on a small subset of problems and may need some tuning.
50
[1850]51   The implementation of these cuts is described in
[1888]52   G. Andreello, A. Caprara, and M. Fischetti
53   "Embedding Cuts in a Branch and Cut Framework: a Computational Study with {0,1/2}-Cuts"
[1850]54   INFORMS Journal on Computing 19(2), 229-238, 2007
[1888]55   http://dx.doi.org/10.1287/ijoc.1050.0162
56
576. An alternative implementation of a reduce and split cut generator by Giacomo Nannicini is now available.
58   By default, these cuts are off.  To use add to your command line -reduce2AndSplitCuts root (or other options).
59
60   The implementation of these cuts is described in
61   G. Cornuejols and G. Nannicini
62   "Practical strategies for generating rank-1 split cuts in mixed-integer linear programming"
63   Mathematical Programming Computation 3(4), 281-318, 2011
64   http://dx.doi.org/10.1007/s12532-011-0028-6
65
667. An alternative robust implementation of a Gomory cut generator by Giacomo Nannicini is now available.
67   By default, these cuts are off.  To use add to your command line -GMI root (or other options).
68
69   The implementation of these cuts is described in
70   G. Cornuejols, F. Margot, and G. Nannicini
71   "On the safety of Gomory cut generators"
72   http://faculty.sutd.edu.sg/~nannicini/index.php?page=publications
[1902]73
748. To encourage the use of some of the more exotic/expensive cut generators a parameter -slowcutpasses has been added.
75   The idea is that the code does these cuts just a few times - less than the more usual cuts.  The default is 10.
76   The cut generators identified by "may be slow" at present are just Lift and project and ReduceAndSplit (both versions).
[1888]77   
[1902]789. Allow initialization of random seed by user.  Pseudo-random numbers are used in Cbc and Clp.  In Clp they
[1853]79   are used to break ties in degenerate problems, while in Cbc heuristics such as the Feasibility Pump use them   
80   to decide whether to round up or down.  So if a different pseudo-random seed is given to Clp then you may get
81   a different continuous optimum and so different cuts and heuristic solutions. This can be switched on by
82   setting randomSeed for Clp and/or randomCbcSeed for Cbc.  The special value of 0 tells code to use time of day
83   for initial seed.
[1888]84   
[1902]8510. Building on this idea, Andrea Lodi, Matteo Fischetti, Michele Monaci, Domenico Salvagnin, Yuji Shinano, and Andrea Tramontani
86   suggest that this idea be improved by running at the root node with multiple copies of solver, each
[1853]87   with its own different seed and then passing in the solutions and cuts so that the main solver has a richer
[1902]88   set of solutions and possibly stronger cuts.  This is switched on by setting -multipleRootPasses.  These can also
[1853]89   be done in parallel.
[1888]90 
[1902]9111. Few changes to presolve for special variables and badly scaled problems (in CoinUtils).
[1848]92
[1902]9312. New option -extraVariables <number> which switches on a trivial re-formulation that introduces extra integer variables
94    to group together variables with same cost.
[1850]95
[1902]9613. For some problems, cut generators and general branching work better if the problem would be infeasible if the cost is too high.
97    If the new option -constraintFromCutoff is set, the objective function is added as a constraint which rhs is set to the current
98    cutoff value (objective value of best known solution).
[1853]99
[1792]100Release 2.7.8:
[1803]101   Look at https://projects.coin-or.org/Cbc/changeset?old_path=%2Freleases%2F2.7.7&new_path=%2Freleases%2F2.7.8 to see all changes.
[1792]102
1031. Change message when LP simplex iteration limit is hit from "Exiting on maximum nodes"
104   to "Exiting on maximum number of iterations"
105
[1803]1062. Fix for using overlapping SOS.
107
1083. Fixes in buildsystem.
109
[1785]110Release 2.7.7:
[1792]111   Look at https://projects.coin-or.org/Cbc/changeset?old_path=%2Freleases%2F2.7.6&new_path=%2Freleases%2F2.7.7 to see all changes.
[1785]112
1131. Fix to report interruption on user event if SIGINT is received by CbcSolver.
114   model->status() should now be 5 if this event happened.
115   Added method CbcModel::sayEventHappened() to make cbc stop due to an 'user event'.
116
1172. Other minor fixes.
118
119Release 2.7.6:
[1792]120   Look at https://projects.coin-or.org/Cbc/changeset?old_path=%2Freleases%2F2.7.5&new_path=%2Freleases%2F2.7.6 to see all changes.
[1785]121
1221. Fixes to build system.
123
1242. Other minor fixes.
125
126Release 2.7.5:
[1792]127   Look at https://projects.coin-or.org/Cbc/changeset?old_path=%2Freleases%2F2.7.4&new_path=%2Freleases%2F2.7.5 to see all changes.
[1785]128
1291. Fixes to get AMPL interface working again.
130
1312. More fixes to MSVC++ files.
132
133Release 2.7.4:
[1792]134   Look at https://projects.coin-or.org/Cbc/changeset?old_path=%2Freleases%2F2.7.3&new_path=%2Freleases%2F2.7.4 to see all changes.
[1785]135
1361. Minor bugfixes.
137
138Release 2.7.3:
[1792]139   Look at https://projects.coin-or.org/Cbc/changeset?old_path=%2Freleases%2F2.7.2&new_path=%2Freleases%2F2.7.3 to see all changes.
[1785]140
1411. Minor bugfixes.
142
1432. Fixes to MSVC++ files.
144
[1729]145Release 2.7.2:
[1792]146   Look at https://projects.coin-or.org/Cbc/changeset?old_path=%2Freleases%2F2.7.1&new_path=%2Freleases%2F2.7.2 to see all changes.
[1729]147
1481. Allow row/column names for GMPL models.
149
1502. Added CbcModel::haveMultiThreadSupport() to indicate whether Cbc library has been compiled with multithread support.
151
1523. Added CbcModel::waitingForMiniBranchAndBound() to indicate whether sub-MIP heuristic is currently running.
153
1544. Cbc shell should work with readline if configured with --enable-gnu-packages.
155
1565. Support for compressed input files (.gz, .bz2) is now enabled by default.
157
1586. Fix problems with relative gap tolerance > 100% and further bugs.
159
1607. Fixes for MSVC++ Version 9 files.
161
1628. Minor fixes in buildsystem; update to BuildTools 0.7.1.
163
[1703]164Release 2.7.1:
[1792]165   Look at https://projects.coin-or.org/Cbc/changeset?old_path=%2Freleases%2F2.7.0&new_path=%2Freleases%2F2.7.1 to see all changes.
[1703]166
1671. Fixes to MSVC++ files
168
[1690]169Release 2.7.0:
[2]170
[1690]1711. License has been changed to the EPL.
[2]172
[1690]1732. Support for MSVC++ version 10 added.
[2]174
[1690]1753. Support for BuildTools version 0.7 to incorporate recent enhancements,
176including proper library versioning in Linux, prohibiting installation of
177private headers, etc.
[2]178
[1690]1794. Updated externals to new stable versions of dependent projects.
[2]180
[1690]1815. Improvements to heuristics.
[2]182
[1690]1836. New options for cut generation.
[2]184
[1690]1857. Improved reporting of results.
[2]186
[1690]1878. Improvements to documentation.
[2]188
[1703]1899. Minor bug fixes.
190
191SUPPORT
192=======
193
1941. List Serve
195
196CBC users should use the Cbc mailing list. To subscribe, go to
197http://list.coin-or.org/mailman/listinfo/cbc
198
1993. Bug Reports
200
201Bug reports should be reported on the CBC development web site at
202
203https://projects.coin-or.org/Cbc/newticket
Note: See TracBrowser for help on using the repository browser.