Changes between Version 3 and Version 4 of CglProbing


Ignore:
Timestamp:
May 30, 2006 7:54:39 AM (13 years ago)
Author:
guest
Comment:

--

Legend:

Unmodified
Added
Removed
Modified
  • CglProbing

    v3 v4  
    33Contributor: John J. Forrest[[BR]]
    44Maintainer: John J. Forrest, jjforre@us.ibm.com
     5
     6== Introduction ==
    57
    68This is a simplification of probing ideas put into OSL about ten years ago. The only known documentation is a copy of a talk handout - we think Robin Lougee-Heimer has a copy!
     
    2830  * 4) Similarly we can generate implied disaggregation cuts
    2931
     32---------
     33
     34== Notes ==
     35
    3036Note - differences to cuts in OSL.
    3137
     
    3541 * d) This code can cope with general integer variables.
    3642
     43---------
     44
     45== Parameters ==
     46
    3747The mode options are:
    3848 * 0) Only unsatisfied integer variables will be looked at. If no information exists for that variable then probing will be done so as a by-product you "may" get a fixing or infeasibility.  This will be fast and is only available if a snapshot exists (otherwise as 1). The bounds in the snapshot are the ones used.
    3949 * 1) Look at unsatisfied integer variables, using current bounds. Probing will be done on all looked at.
    4050 * 2) Look at all integer variables, using current bounds. Probing will be done on all
     51
     52---------
     53
     54== Documentation and Bug Reports ==
     55
     56See the "Project Links" Section on the {{{Cgl}}} main [http://projects.coin-or.org/Cgl page]