The minimum maximal k-partial-matching problem

DOI10.1007/S11590-012-0531-3zbMath1287.90082OpenAlexW1987110199MaRDI QIDQ395867

Ignacio Garcia-Vargas, Raouf Senhadji-Navarro

Publication date: 30 January 2014

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://idus.us.es/handle//11441/90799

zbMATH Keywords

bipartite graphNP-completenessset coverfinite state machinehitting setpartial-matching

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10)

Uses Software

• SageMath
• Gurobi

Cites Work

• Structure preserving reductions among convex optimization problems
• Semi-matchings for bipartite graphs and load balancing
• Unnamed Item

This page was built for publication: The minimum maximal k-partial-matching problem