Difference between revisions of "Category:MIP Optimization"
From COST Action FP0804: FORSYS
(Created page with 'This category encompasses systems that use Mixed Integer Programming (MIP) optimization techniques for finding a solution for a complex combinatorial optimization problem, genera...') |
|||
| Line 1: | Line 1: | ||
This category encompasses systems that use Mixed Integer Programming (MIP) optimization techniques for finding a solution for a complex combinatorial optimization problem, generally by selecting a set of options through a rigorous mathematical solution procedure | This category encompasses systems that use Mixed Integer Programming (MIP) optimization techniques for finding a solution for a complex combinatorial optimization problem, generally by selecting a set of options through a rigorous mathematical solution procedure | ||
| + | |||
| + | [[Category:DSS by optimization methods]] | ||
Revision as of 13:41, 3 September 2009
This category encompasses systems that use Mixed Integer Programming (MIP) optimization techniques for finding a solution for a complex combinatorial optimization problem, generally by selecting a set of options through a rigorous mathematical solution procedure
This category currently contains no pages or media.
