Minimum cost b-matching problems with neighborhoods

I. Espejo (), R. Páez, J. Puerto and A. M. Rodríguez-Chía
Additional contact information
I. Espejo: Universidad de Cádiz
R. Páez: Universidad de Cádiz
J. Puerto: Universidad de Sevilla
A. M. Rodríguez-Chía: Universidad de Cádiz

Computational Optimization and Applications, 2022, vol. 83, issue 2, No 5, 525-553

Abstract: Abstract 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.

Keywords: Matching; Neighborhoods; SOC formulations (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10589-022-00406-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:coopap:v:83:y:2022:i:2:d:10.1007_s10589-022-00406-7

Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589

DOI: 10.1007/s10589-022-00406-7

Access Statistics for this article

Computational Optimization and Applications is currently edited by William W. Hager

More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().