Jump to content

Main Page: Difference between revisions

From mintOC
No edit summary
No edit summary
Line 3: Line 3:
As, in contrast to say linear programming problems, there are no standard formats for the formulation of such problems, and they often show completely different characteristics, these pages dedicate some space for a thorough description.  
As, in contrast to say linear programming problems, there are no standard formats for the formulation of such problems, and they often show completely different characteristics, these pages dedicate some space for a thorough description.  


This page has been set up and is being maintained by the [http://www.iwr.uni-heidelberg.de Mathematical and Computational Optimization] group in Heidelberg, but contributions are more than welcome!
This page has been set up and is being maintained by the [http://mathopt.uni-hd.de Mathematical and Computational Optimization] group in Heidelberg, but contributions are more than welcome!


The best way to quickly navigate through existent problem descriptions is probably the [[:Special:Categories|category listing]].
The best way to quickly navigate through existent problem descriptions is probably the [[:Special:Categories|category listing]].

Revision as of 18:19, 19 October 2008

This wiki contains a benchmark library of mixed-integer optimal control problems. The main intention is to provide algorithm developers with a set of challenging problems to evaluate their numerical optimization methods.

As, in contrast to say linear programming problems, there are no standard formats for the formulation of such problems, and they often show completely different characteristics, these pages dedicate some space for a thorough description.

This page has been set up and is being maintained by the Mathematical and Computational Optimization group in Heidelberg, but contributions are more than welcome!

The best way to quickly navigate through existent problem descriptions is probably the category listing.

Useful (internal) links