Pages that link to "Item:Q3315292"
From MaRDI portal
The following pages link to A survey of heuristics for the weighted matching problem (Q3315292):
Displayed 13 items.
- Quotient geometric crossovers and redundant encodings (Q418019) (← links)
- Greedy matching on a grid (Q921922) (← links)
- An analysis of a decomposition heuristic for the assignment problem (Q1062912) (← links)
- A lower bound to the complexity of Euclidean and rectilinear matching algorithms (Q1072708) (← links)
- On the existence of weak greedy matching heuristics (Q1080871) (← links)
- Approximate minimum weight matching on points in k-dimensional space (Q1825658) (← links)
- On computing the diameter of a point set in high dimensional Euclidean space. (Q1853493) (← links)
- New primal and dual matching heuristics (Q1891231) (← links)
- Almost stable matchings by truncating the Gale-Shapley algorithm (Q1959728) (← links)
- Probabilistische analyse von heuristiken der kombinatorischen optimierung – ein überbllck (Q3200892) (← links)
- Probabilistic Analysis of a Greedy Heuristic for Euclidean Matching (Q3415878) (← links)
- (Q4536416) (← links)
- AN EFFICIENT PARALLEL ALGORITHM FOR THE ASSIGNMENT PROBLEM ON THE PLANE∗ (Q4820048) (← links)