Tags: cddlib/cdd
Tags
Version 0.60 The following changes are equivalent to ones that had been made for cdd+-074. The default output file names have been changed to be consistent with the transformation. To avoid confusion, *.ine file should be used only for a system of linear inequalities, and *.ext file only for a set of extreme points and rays. Accordingly, the files *.ead (previously *.adj) and *.ecd (previously *.icd) are reserved for the adjacency and incidence files for the extremal vertices/rays. Similarly, *.iad (previously *.iad) and *.icd (previously none) are reserved for the adjacency and incidence files for the inequality data. The LP code is now independent of cdd, and rewritten as a C library. This library is called dplex, and contains two algorithms, the dual simplex and the criss-cross method. Imported in Apr 2018 from cdd-060.tar.gz released Aug 27, 1996.
Version C0.56 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). Imported in Apr 2018 from cdd-056.tar.gz released Aug 7, 1995.
Version C0.55a The broken "preprojection" option in Version 0.55 is fixed. Imported in Apr 2018 from cdd-055a.tar.Z released Dec 18, 1994. The preceding version had no tarball available anymore: Version C0.55 (Dec 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.53a
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).
Imported in Apr 2018 from cdd-053a.tar.Z released Jul 29, 1994.
Version C0.51d 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. Imported in Apr 2018 from cdd-051d.tar.Z released Mar 28, 1994. The following preceding versions had no tarball in Apr 2018: Version C0.52 (Mar 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 (Mar 28, 1994) ----------------------------- * A bug of Version C0.52 generating unnecessary information when maximize, minimize and find_interior are chosen is fixed.
Version C0.51c 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. Imported in Apr 2018 from cdd-051c.tar.Z released Mar 15, 1994. The following preceding versions had no released tarball in Apr 2018: 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 (Mar 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.38 * 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. Imported in Apr 2018 from cdd-038.tar.Z released Jan 31, 1994. The following preceding version had no released tarball in Apr 2018: Version C0.37 (Jan 25, 1994) ---------------------------- Amatrix struct has been modified to store only the row pointers.
PreviousNext