POLIP

This web site features a collection of polynomially constrained mixed-integer programming instances.

It complements the other collections of nonlinear mixed-integer programming instances:

• Only polynomially constrained problems are present.
• The instances are coded in an easy data format: the PIP format.
• Many of the instances are nonlinear formulations of combinatorial optimization problems.

One idea of this web site is to promote research and the develoment of software to deal with nonlinear formulations of combinatorial optimization problems. Time will tell whether these models and corresponding software to solve them will be competitive with the existing methods.

We think that polynomially constrained programs provide an important type of problems. The instances are easy to write down in a human readable format. Thus, no proprietary software is needed to handle them. We hope that the performance of solution software for these kinds of problems will continue to improve.

So far, there are two programs that can handle the PIP format:

• The open source modeling language ZIMPL can generate output in PIP format.
• The constraint integer programming solver SCIP can read and (try to) solve instances in PIP format.

Hopefully, in the future other software will be able to handle the PIP format as well.

In addition, most instances are available in GAMS (*.gms) and AMPL (*.mod) format.

POLIP is hosted at Zuse Institute Berlin.

Contents

News

POLIP contains contributions by

• Ambros Gleixner, Zuse Institute Berlin
• Andreas Karrenbauer, MPI Saarbrücken
• Frauke Liers, University of Erlangen-Nürnberg
• Ulrike Pagacz, University of Cologne
• Marc Pfetsch, TU Darmstadt
• Stefan Vigerske, GAMS

We request your help!

If you have instances, can provide solutions, or corrections, please tell us! We would like to extend the set of currently provided instances.

Related Links

Disclaimer

Most of the data files on this site have been converted. Some data were gathered from papers, typed in by hand, or generated by automatic solution extraction programs. While we took every effort to make no mistakes, we cannot guarantee that everything is correct. If you find any errors or have doubts about a solution, please contact us.

© by maintainers  |  last update LAST_CHANGE  |  imprint