Difference between revisions of "Main Page"
Jump to navigation
Jump to search
| (One intermediate revision 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> | ||
Latest revision as of 18:06, 17 November 2020
|
|
|
Sponsor
