Pages that link to "Item:Q1068525"
From MaRDI portal
The following pages link to On the use of optimal fractional matchings for solving the (integer) matching problem (Q1068525):
Displaying 12 items.
- Blossom V: A new implementation of a minimum cost perfect matching algorithm (Q734352) (← links)
- Solving (large scale) matching problems combinatorially (Q750322) (← links)
- \textsc{Laps}\ \textsc{Care} -- an operational system for staff planning of home care (Q819093) (← links)
- Structural analysis of a fractional matching problem (Q967441) (← links)
- Solving combinatorial optimization problems using Karmarkar's algorithm (Q1196181) (← links)
- Testing the necklace condition for shortest tours and optimal factors in the plane (Q1262765) (← links)
- Aircrew schedule generation using repeated matching (Q1291572) (← links)
- An efficient matching algorithm applied in statistical physics (Q1331902) (← links)
- A repeated matching heuristic for the single-source capacitated facility location problem (Q1610126) (← links)
- A \(\frac{1}{2}\)-integral relaxation for the \(A\)-matching problem (Q2466594) (← links)
- Efficient approximation algorithms for weighted \(b\)-matching (Q2830632) (← links)
- Approximation algorithms in combinatorial scientific computing (Q5230524) (← links)
