The NetBSD Project

CVS log for pkgsrc/math/glpk/distinfo

[BACK] Up to [cvs.NetBSD.org] / pkgsrc / math / glpk

Request diff between arbitrary revisions


Default branch: MAIN
Current tag: pkgsrc-2007Q4


Revision 1.14 / (download) - annotate - [select for diffs], Sun Nov 25 18:47:50 2007 UTC (11 years, 11 months ago) by adam
Branch: MAIN
CVS Tags: pkgsrc-2007Q4-base, pkgsrc-2007Q4
Changes since 1.13: +4 -4 lines
Diff to previous 1.13 (unified)

Changes 4.24:
A tentative implementation of MIR (mixed integer rounding) cuts
was included in the MIP solver. To enable generating MIR cuts
the control parameter mir_cuts passed to the routine glp_intopt
should be set to GLP_ON. This feature is also available in the
stand-alone solver glpsol via command-line option '--mir'. For
more details please see the reference manual included in the
distribution.

The implementation is mainly based on the following two papers:

1. H. Marchand and L. A. Wolsey. Aggregation and mixed integer
   rounding to solve MIPs. CORE discussion paper 9839, CORE,
   Universite catholique de Louvain, June 1998.

2. G. Andreello, A. Caprara, and M. Fischetti. Embedding cuts
   in a Branch&Cut framework. Preliminary draft, October 2003.

MIR cuts can be generated on any level of the search tree that
makes the GLPK MIP solver to be a real branch-and-cut solver.

A bug was fixed in the routine lpx_write_cpxlp. If a variable
x has upper bound and no lower bound, it should appear in the
bounds section as "-inf <= x <= u", not as "x <= u". Thanks to
Enric Rodriguez <erodri@lsi.upc.edu> for the bug report.

This form allows you to request diff's between any two revisions of a file. You may select a symbolic revision name using the selection box or you may type in a numeric name using the type-in text box.




CVSweb <webmaster@jp.NetBSD.org>