RT journal article
T1 Minimum cost b-matching problems with neighborhoods
A1 Espejo Miranda, Inmaculada
A1 Páez Jiménez, Raúl
A1 Puerto, J
A1 Rodríguez Chía, Antonio Manuel
A2 Estadística e Investigación Operativa
K1 Matching
K1 Neighborhoods
K1 SOC formulations
AB In this paper, we deal with minimum cost b-matching problems on graphs where the nodes are assumed to belong to non-necessarily convex regions called neighborhoods, and the costs are given by the distances between points of the neighborhoods. The goal in the proposed problems is twofold: (i) finding a b-matching in the graph and (ii) determining a point in each neighborhood to be the connection point among the edges defining the b-matching. Different variants of the minimum cost b-matching problem are considered depending on the criteria to match neighborhoods: perfect, maximum cardinality, maximal and the a-b-matching problems. The theoretical complexity of solving each one of these problems is analyzed. Different mixed integer non-linear programming formulations are proposed for each one of the considered problems and then reformulated as Second Order Cone formulations. An extensive computational experience shows the efficiency of the proposed formulations to solve the problems under study.
PB SPRINGER
SN 1573-2894
YR 2022
FD 2022-08
LK http://hdl.handle.net/10498/27588
UL http://hdl.handle.net/10498/27588
LA eng
DS Repositorio Institucional de la Universidad de Cádiz
RD 11-nov-2026