|
|
 |
|
Jeudi 16 Octobre
| Heure: |
10:30 - 12:00 |
| Lieu: |
Salle B107, bâtiment B, Université de Villetaneuse |
| Résumé: |
The neighborhood dominant polytope |
| Description: |
Yue Zhang We propose a new polyhedral approach for combinatorial optimization problems. Rather than working on the convex hull of the feasible set, we focus on a polytope that excludes the uninteresting feasible solutions dominated in a local neighborhood. In this work, the idea is applied to the linear Knapsack problem and the quadratic MaxCut problem with a theoretical study that demonstrates dominance inequalities and facets. The outstanding effectiveness of the proposed inequalities is numerically shown on the MaxCut instances from the BiqBin library. |
|
|
