library for polynomially constrained
This web site features a collection of polynomially constrained mixed-integer programming instances.
It complements the other collections of nonlinear mixed-integer programming instances:
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:
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 a Zuse Institute Berlin.
|31 Dec 2013||Added robust flow instances.|
|2 Jun 2011||Added GAMS/AMPL format.|
|28 Feb 2011||Added MaxFS instances.|
|24 Jan 2011||Website launched.|
If you have instances, can provide solutions, or corrections, please tell us! We would like to extend the set of currently provided instances.
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 : 2014-03-13 19:59:30 +0100 (Thu, 13. Mar 2014) $ by : marc.pfetsch $ | imprint