Pages that link to "Item:Q3563606"
From MaRDI portal
The following pages link to The pure parsimony haplotyping problem: overview and computational advances (Q3563606):
Displaying 5 items.
- A new mathematical modeling for pure parsimony haplotyping problem (Q338689) (← links)
- Exact and heuristic approaches for the set cover with pairs problem (Q691479) (← links)
- Better lower and upper bounds for the minimum rainbow subgraph problem (Q2250438) (← links)
- A \textit{branch} \& \textit{price} algorithm for the minimum cost clique cover problem in max-point tolerance graphs (Q2423295) (← links)
- Effective heuristics for the Set Covering with Pairs Problem (Q3002555) (← links)