Main Page: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
(2 intermediate revisions by the same user not shown) | |||
Line 66: | Line 66: | ||
<li>[[Facility location problem]]</li> | <li>[[Facility location problem]]</li> | ||
<li>[[Traveling salesman problem]]</li> | <li>[[Traveling salesman problem]]</li> | ||
<li>[[Set covering problem]]</li> | <li>[[Set covering problem]]</li> | ||
<li>[[Quadratic assignment problem]]</li> | <li>[[Quadratic assignment problem]]</li> | ||
<li>[[Newsvendor problem]]</li> | <li>[[Newsvendor problem]]</li> | ||
<li>[[Unit commitment problem]]</li> | |||
<li>[[Portfolio optimization]]</li> | |||
</div> | </div> | ||
|} | |} | ||
Line 96: | Line 96: | ||
<li>[[Signomial problems]]</li> | <li>[[Signomial problems]]</li> | ||
<li>[[Mixed-integer linear fractional programming (MILFP)]]</li> | <li>[[Mixed-integer linear fractional programming (MILFP)]]</li> | ||
<li>[[Convex | <li>[[Convex generalized disjunctive programming (GDP)]]</li> | ||
<li>[[Nonconvex | <li>[[Nonconvex generalized disjunctive programming (GDP)]]</li> | ||
<li>[[Branch and bound (BB) for MINLP]]</li> | <li>[[Branch and bound (BB) for MINLP]]</li> | ||
<li>[[Branch and cut for MINLP]]</li> | <li>[[Branch and cut for MINLP]]</li> | ||
Line 133: | Line 133: | ||
| style="color:#000;padding:2px 5px 5px" | <div id="mp-dyk"> | | style="color:#000;padding:2px 5px 5px" | <div id="mp-dyk"> | ||
<li>[[Protein folding problem]]</li> | <li>[[Protein folding problem]]</li> | ||
<li>[[Wing | <li>[[Wing shape optimization]]</li> | ||
<li>[[Optimization in | <li>[[Optimization in game theory]]</li> | ||
<li>[[Quantum computing for optimization]]</li> | <li>[[Quantum computing for optimization]]</li> | ||
</div> | </div> |
Revision as of 18:06, 17 November 2020
|
|
|
Sponsor