cdd & cdd+ HISTORY file (as of September 6, 1995) *** cdd version (date) / changes *** Version C0.21 (November 10, 1993) / - The first version of cdd created by translating pdd.p (0.21) with Dave Gillespie's p2c translator and by modifying the c-code. The set operation libraries setoper.c, setoper.h (Nov.14, 1993) were created to make the code run without any p2c libraries. Version C0.22 (November 21, 1993) / - File open procedures have been updated. Version C0.23 (November 22, 1993) / - First release of cdd. Version C0.23a, b (November 23, 1993) / - Few small bugs of C0.23 have been fixed. - Up to this version, the program can deal with column size at most 32. Version C0.24 (November 27, 1993) / - Modified to be able to deal with column size (nn) larger than 32. - Bugs of LexMin, LexMax ordering options are fixed. Version C0.25 (November 28, 1993) - The bug for mishandling the empty polyhedra input is fixed. Accordingly, the new variable CompStatus (Completion Status) has been added. - The procedure AddNewHyperplane and EvaluateARay have been completely changed. EvaluateARay computes A(hnew) * Ray for each Rays, and sort the linked list of rays so that the hnew-infeasible rays will be put consecutively from FirstRay. Version C0.26 (November 29, 1993) / - FindBasis has been modified to be faster when the number of inequalities is large. - addition of #incidence option for outputting the cardinality of active hyperplanes instead of the set of all active hyperplanes at each vertex. - InitBasisAtBottom option has been added to select the last set of rows as the initial basis (determining a simplex cone/polytope). This option is {\em not\/} default. See User's manual. Version C0.26b(December 8, 1993) / - FindBasis and ComputeRank have been replaced with new programs which do not copy Amatrix (for save storage and time). Accordingly, the procedure CopyAmarix has been removed. Version C0.27(December 8, 1993) / - It uses a new versions of setoper.h and setoper.c (Dec 8, 1993 version) which have set complemen procedure set_compl. Version C0.31(December 20, 1993) / - The main program cdd.c has been divided into two parts, cdd.c and cddarith.c, the latter contains all the procedures dealing with floating point numbers and operations. - LP solver CrissCrossSolve has been added. Now the option "maximize" can be used to optimize any linear function over the polyhedron. - The setoper library has been updated to accomodate set_card(set) function. Version C0.32(Jan. 11, 1994) / - "preprojection" option has been added. This option can be considered as a preprocessing of orthogonal projection of the polyhedon to a subset of variables. That is, if the inequality inequality system is of form A1 x1 + A2 x2 <= b, and the variable indices for x2, say 1, 4, 6, 7, are listed in the input file as ------------- begin m n Type b -A1 -A2 end preprojection 4 1 4 6 7 ------------- Then, cdd will output the inequality system, A1 x1 <= b, together with the list R of extremal rays of the homogeneous cone {z: z >=0 and z A2 = 0 }. Consequently, the inequality system {r A1 x1 <= r b for each r in R} represents the projection of the original polyhedron onto x1-space with possible redundancy. The supplementary C program (written by F. Margot) will be used to obtain a minimal system from these two outputs. Version C0.33(Jan. 16, 1994) / - partial_enumeration option has been added. By this option, one can enumerate all vertices and rays which are lying on a selected set of inequalities. The input ------------- begin m n Type b -A1 -A2 end partial_enumeration 4 1 4 6 7 ------------- restricts the enumeration for those lying on the 1st, 4th, 6th & 7th hyperplanes. Version C0.34(Jan. 22, 1994) / - adjacency option has been added to output the adjacency list of output. Version C0.35(Jan. 23, 1994) / - RayRecord struct has been modified to store only a pointer for a Ray vector so that the necessary space for the vector is allocated each time. This saves a space for storing each RayRecord. Version C0.36(Jan. 23, 1994) / - RayRecord struct has been modified to store only a pointer for a ZeroSet so that the necessary space for the set is allocated each time. This saves a space for storing each RayRecord ZeroSet. For this modification, the setoper library must have been changed so that set_initialize allocates the minimum space. Note that this new version (Jan. 23, 1994) does not work with the older cdd programs. Version C0.37(Jan. 25, 1994) / - Amatrix struct has been modified to store only the row pointers. Version C0.38(Jan. 31, 1994) / - Bmatrix struct has been modified to store only the row pointers. Thus the program does not use any 2-dim arrays, and uses mainly dynamic allocation memory as much as necessary irrespective of the declared maximum size MMAX times NMAX. Thus, even in Macintosh computers large problems can be solved. - CrissCrossSolve LP solver has been updated to output dual solutions as well. Version C0.50 (Feb. 7, 1994) / - Major upgrade to implement a new data structure to store adjacencies of rays. The adjacency record lists, Edges(iteration), are used to store only necessary adjacencies for each iteration. This version runs much faster unless a dynamic ordering of rows (i.e. maxcutoff or mincutoff) is chosen. The users are strongly discouraged to use these dynamic ordering options. Version C0.51 (Feb. 12, 1994) / - Some bugs of Version C0.50 has been fixed. - The option "algebraic" for selecting the algebraic adjacency computation is deleted. The reason is the combinatorial adjacency computation is almost always faster. - The option "minimize" is implemented to minimize a linear function over the polytope. Previously, only "maximize" was supported. - The option "find_interior" has been added to compute an interior point of the input polyhedron. Version C0.51a (Feb. 16, 1994) / - A bug of Version C0.51 (mishandling of empty polyhedron) is fixed. Version C0.51b (March 9, 1994) / - A bug of Version C0.51a (mishandling of non full-dimensional polyhedron) is fixed. The bug was reported by Alexander Bockmayr of Max-Planck Institute. Version C0.51c (March 15, 1994) / - A bug of Version C0.51b (mishandling of homogeneous inputs, i.e. zero RHS) is fixed. This bug was reported by Alexander Bockmayr of Max-Planck Institute. Version C0.52 (March 21, 1994) / - A bug of Version C0.51c generating segmentation fault when the option preprojection is used is fixed. This bug was reported by Alexander Bockmayr of Max-Planck Institute. - Some structural changes in the programs, cdd.c and cddarith.c, have been made mainly for a future planning of adding an option to decompose a problem into smaller subproblems. Version C0.52a (March 28, 1994) / - A bug of Version C0.52 generating unnecessary information when maximize, minimize and find_interior are chosen is fixed. Version C0.51d (March 28, 1994) / - Because of the slowness of Version 0.52* due to unknown reasons, this version has been produced for a temporary replacement. This version fixes the bug mentioned in Version C0.52 release. Version C0.52b (March 28, 1994) / - The slowness problem of Version C0.52(a) is fixed. Version C0.53 (July 29, 1994) / - Some imcompatibility of cdd and domcheck has been fixed. Namely, one can write any comments after each inequality data as long as it is written in the same line as the last number (i.e., a_{id}, for each i) of each ith inequality data. Anything written after the last number will be ignored. Also, random ordering option is added for specifying the ordering of rows (inequalities). Version C0.54 (October 30, 1994) / The partial_enumeration option is renamed as "equality" option. A new option of "strict_inequality" is added to enumerate those vertices/rays satisfying some specified inequalities with strict inequality. Some bugs in reporting progress of iteration is fixed. Version C0.55 (December 5, 1994) / Set operation library setoper has been modified to use the optimized set_card function by David Bremner. It is expected that cdd runs much faster for problems with large row sizes. The package organization has been changed. Now the package consists of four C-programs, cdd.c, cddio.c, cddarith.c and setoper.c. New options verify_input, equality and strict_inequality are added. Also new options, lineshelling and row_decomposition are added but these options are still not in very reliable form and not recommended to use. Some newly found (minor) bugs are fixed. Version C0.55a (December 18, 1994) / The broken "preprojection" option in Version 0.55 is fixed. Version C0.56 (August 7, 1995) / Some compilation problem associated with incompatible set_type variables in setoper.c is fixed. Various minor bugs are fixed. The output format of incidence file is slightly modified. (See the Reference Manual cddman.tex). *** cdd+ version (date) / changes *** ccd+ Version 0.70 (April 3, 1995) / The first C++ version of cdd which can run on both floating-point and rational (exact) arithmetics. The basic functions are identical to cdd-055. This version requires GNU gcc compilers (2.6.0 or higher) and a compatible g++lib. ccd+ Version 0.71 (April 15, 1995) / Two new functions (through options) are added. The option "facet_listing" checks whether each input inequality determines a facet or not. The second option "tope_listing" generates all full-dimensional regions (topes) of the associated arrangement of hyperplanes by reverse search algorithm. Also, the option "show_tableau" is added to illustrate how the criss-cross method works in the tableau (dictornary) form. Criss-cross LP solver is now sensitive to ordering options, lexmin, minindex, radom, etc. ccd+ Version 0.72 (April 16, 1995) / The option "postanalysis" is added. This option is to be used after *.ext file is obtained. When this option is set with adjacency and/or incidence options, one can get adjacency and incidence files from both *.ine and *.ext files. Thus it is not necessary to generate *.adj and *.icd files together with *.ext file. ccd+ Version 0.72a (April 16, 1995) / Cycling bug of Version 072 of LP maximize and minimize has been fixed. ccd+ Version 0.73 (Septembe 6, 1995) / A new option "input_adjacency" has been added. The output format of incidence file is slightly modified. (See the Reference Manual cddman.tex). This incidence file format is compatible with cdd-056 and we will try not to change the format any more. --- end of file: cddHISTORY ---