Weighted matching with pair restrictions
From MaRDI portal
Publication:1749789
DOI10.1007/s11590-017-1217-7zbMath1400.90259OpenAlexW2769457681MaRDI QIDQ1749789
Publication date: 28 May 2018
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-017-1217-7
traveling salesman problemassignmentgammoidmatching matroidprize collectingweighted graph matchingweighted matroid parity
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on the prize collecting traveling salesman problem
- An augmenting path algorithm for linear matroid parity
- Solving school bus routing using the multiple vehicle traveling purchaser problem: a branch-and-cut approach
- Solving the linear matroid parity problem as a sequence of matroid intersection problems
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- A simple PTAS for weighted matroid matching on strongly base orderable matroids
- Algebraic Algorithms for Linear Matroid Parity Problems
- Matroid Matching: The Power of Local Search
- A Fast, Simpler Algorithm for the Matroid Parity Problem
- The prize collecting traveling salesman problem
- Random pseudo-polynomial algorithms for exact matroid problems
- Randomized Parallel Algorithms for Matroid Union and Intersection, with Applications to Arborescences and Edge-Disjoint Spanning Trees
- A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3
- A General Approximation Technique for Constrained Forest Problems
This page was built for publication: Weighted matching with pair restrictions