|
|
 |
|
Jeudi 8 Février
| Heure: |
10:30 - 11:30 |
| Lieu: |
Salle B107, bâtiment B, Université de Villetaneuse |
| Résumé: |
Exponentially large arc-flow models |
| Description: |
François Clautiaux Network flow formulations are among the most successful tools to solve optimization problems. Such formulations correspond to determining an optimal flow in a network. One particular class of network flow formulations is the arc flow, where variables represent flows on individual arcs of the network. In this talk, we will review classical and recent results on integer linear programming models based on arc-flow formulations in exponentially or pseudo-polynomial size networks. We will study the limitations of these approaches, and how various almost disconnected groups have addressed these limitations. We will describe a recent approach based on the generalization of these models to flow in hypergraphs, and propose some research directions. |
|
|
