Mixed-Integer Formulation of the Combined capacitated Facility Location-Flow Routing Problem

Session : SS1-3 / SS1 : Challenging Mixed-Integer Problems in Network Optimization
Vendredi 12 février 10:30 - 11:50 Salle : CI2-06
Dimitri Papadimitriou

In this paper, we combine the multi-source multi-product capacitated facility (MSMP-cFL) location with the flow routing problem and propose a mixed-integer formulation which enables its applicability to the digital content placement and retrieval problem for multiple (digital) products. We then evaluate the computational time and solution quality of the resulting mixed-integer program and compare the results against those obtained when considering the conventional formulation of the MSMP-cFLP part of the problem.

Mots clés : capacitated facility location problem, flow routing, mixed-integer programming