Difference between revisions of "Main Page"

From mintOC
Jump to: navigation, search
(Undo revision 73 by 93.174.93.220 (Talk))
Line 1: Line 1:
This page is under construction.  
+
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.
  
This wiki contains a benchmark library of mixed-integer optimal control problems.
+
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.  
  
The first problem in the database is the [[Lotka Volterra fishing problem]].
+
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!
  
A categorized list of all problems is available [[:Special:Categories|here]].
+
The best way to quickly navigate through existent problem descriptions is probably the [[:Special:Categories|category listing]].
 
+
Updates might be available soon. Hopefully.
+
  
 
== Useful (internal) links ==
 
== Useful (internal) links ==
  
 +
* The first detailly described problem in the database is the [[Lotka Volterra fishing problem]].
 
* Consult the [http://meta.wikimedia.org/wiki/Help:Contents User's Guide] for information on using the wiki software.
 
* Consult the [http://meta.wikimedia.org/wiki/Help:Contents User's Guide] for information on using the wiki software.
 
* [http://www.mediawiki.org/wiki/Manual:Configuration_settings Configuration settings list]
 
* [http://www.mediawiki.org/wiki/Manual:Configuration_settings Configuration settings list]

Revision as of 10:24, 9 September 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