Solving maximum weighted matching on large graphs with deep reinforcement learning

DOI10.1016/j.ins.2022.10.021OpenAlexW4306405914MaRDI QIDQ6125273

Bohao Wu, Lingli Li

Publication date: 11 April 2024

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2022.10.021

zbMATH Keywords

maximum weighted matchingdeep reinforcement learninggraph neural network

Mathematics Subject Classification ID

Computer science (68-XX) Operations research, mathematical programming (90-XX)

Cites Work

• A simple approximation algorithm for the weighted matching problem
• On mass transportation
• A linear-time approximation algorithm for weighted matchings in graphs
• Emergence of Scaling in Random Networks
• A survey of heuristics for the weighted matching problem
• The Hungarian Method for the Assignment Problem
• JGraphT—A Java Library for Graph Data Structures and Algorithms
• Paths, Trees, and Flowers
• Collective dynamics of ‘small-world’ networks
• Maximum matching and a polyhedron with 0,1-vertices
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Solving maximum weighted matching on large graphs with deep reinforcement learning