|
|
 |
|
Mardi 5 Février
| Heure: |
10:30 - 13:30 |
| Lieu: |
Salle B107, bâtiment B, Université de Villetaneuse |
| Résumé: |
Inversion de Lagrange multivariée |
| Description: |
Axel Bacher |
| Heure: |
12:30 - 13:30 |
| Lieu: |
Salle B107, bâtiment B, Université de Villetaneuse |
| Résumé: |
Separable non-convex underestimators for binary quadratic programming |
| Description: |
Emiliano Traversi We present a new approach to constrained quadratic binary
programming. Dual bounds are computed by choosing appropriate global
underestimators of the objective function that are separable but not
necessarily convex. Using the binary constraint on the variables, the
minimization of this separable underestimator can be reduced to a linear
minimization problem over the same set of feasible vectors. For most
combinatorial optimization problems, the linear version is considerably
easier than the quadratic version. We explain how to embed this approach
into a branch-and-bound algorithm and present experimental results. |
| Heure: |
14:00 - 17:00 |
| Lieu: |
Salle B107, bâtiment B, Université de Villetaneuse |
| Résumé: |
La conjecture de Hadamard |
| Description: |
Shalom Eliahou< |
|
|
