Math Forum Discrete Mathematics Links

Math Forum Integer Programming Links

Discrete Optimization (Max-Planck-Institut fuer Informatik)

Lot-Sizing Problems: A Library of Models and
Matrices

Frequency Assignment Problems (FAP) Test
Problems (Benchmark instances)

Research Group
"Discrete Optimization" (Heidelberg)

Journal "Discrete Applied
Mathematics"

LogMIP
(acronym of Logical Mixed Integer Programming) is a solver for generalized
disjunctive programs (GDP).

Bibliography of papers and
books on combinatorial optimization (Brian Borchers,
1994, BibTeX)

MacMINLP
: AMPL collection of Mixed Integer Nonlinear
Programs (S.Leyffer)

**GLPK** (__G__NU __L__inear __P__rogramming
__K__it) package is intended for solving large-scale linear programming
(LP), mixed integer programming (MIP), and other related problems. It is a set
of routines written in ANSI C and organized in the form of a callable library. GLPK
supports the GNU MathProg language, which is a subset
of the AMPL language.

**Zimpl** is a little language to translate
the mathematical model of a problem into a linear or (mixed-) integer
mathematical program expressed in .lp or .mps file format which can be read and (hopefully)
solved by a LP or MIP solver. Zimpl is a
command line program written in plain C and released under GNU GPL.

**MINTO** - Mixed INTeger
Optimizer - is a software system that solves mixed-integer linear programs by a
branch-and-bound algorithm with linear programming relaxations. It also provides
automatic constraint classification, preprocessing,
primal heuristics and constraint generation.

**SYMPHONY** MILP Solver
Framework. By
default, SYMPHONY reads both the MPS file format (through the COIN-OR MPS reader) and AMPL files (through
the GLPK parser). The **SYMPHONY** source
code is available under the Common Public License.

**TU Darmstadt, Discrete
Optimization. **

**OPBDP** - linear 0-1 (pseudo-boolean) optimization

**CBC **- The **COIN** Branch and Cut solver is an
open-source mixed-integer program (MIP) solver written in C++.