-
Um Algoritmo Branch-and-Bound para o Problema da Máxima Interseção de k-Subconjuntos
Vol 52, 2020 -128575
Publications in other proceedings
Streamline your Scholarly Event
With nearly 200,000 papers published, Galoá empowers scholars to share and discover cutting-edge research through our streamlined and accessible academic publishing platform.
Learn more about our products:
