Pages that link to "Item:Q2423295"
From MaRDI portal
The following pages link to A \textit{branch} \& \textit{price} algorithm for the minimum cost clique cover problem in max-point tolerance graphs (Q2423295):
Displaying 2 items.