I. Espejo Miranda, R. Páez Jiménez, J. Puerto Albandoz, A. M. Rodríguez Chía
Combinatorial optimization has important applications in real world situations. Many such applications can be formulated as optimization problems defined on graphs, this is the case of planning shortest paths, spanning trees, and matching among others. However, many often the exact location of the nodes is unknown and the assumption of modelling the nodes by points should be revised. In this sense, we propose to consider uncertainty regions or neighborhoods where the points will lie very likely. We deal with combinatorial optimization problems on graphs where nodes are represented by neighborhoods that are not necessarily convex. We will develop non-linear mixed integer programming formulations with second order cone constraints and study the structure of this kind of problem.
Palabras clave: Combinatorial optimization, neighborhoods, SOC formulations
Programado
GT01 Localización V. Localización Continua
8 de junio de 2022 17:20
A15
