Links on Discrete Programming

Discrete Optimization Methods. The Pascal procedures available in this archive are taken with permission from Discrete Optimization Algorithms with Pascal Programs by Maciej M. Syslo, Narsingh Deo, and Janusz S. Kowalik. This text was published in 1983 by Prentice-Hall, Inc., Englewood Cliffs, NJ.

Lot-Sizing Problems: A Library of Models and Matrices

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

A Set of Examples of Discrete Optimization, Dynamic Programming, and Linear Programming (by Jonas Mockus)

Research Group "Discrete Optimization" (Heidelberg)

Journal "Discrete Applied Mathematics"

Fred Glover's Home Page

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

Ivo Nowak. Relaxation and Decomposition Methods for Mixed Integer Nonlinear Programming. Series: International Series of Numerical Mathematics, Vol. 152 , 2005

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

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

Slides on MINLP

GLPK (GNU Linear Programming Kit) 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.

SoPlex - The Sequential object-oriented simplex class library. One is allowed to retrieve SoPlex only for research purpose as a member of a non-commercial and academic institution.

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.

SCIP - Solving Constraint Integer Programs. SCIP is implemented as C callable library and provides C++ wrapper classes for user plugins.

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++.