maximum flow problem
[/ˈmæksɪməm floʊ ˈprɑbləm/]
nounpl: maximum flow problems
problema de fluxo máximo
1. A computational problem in graph theory and optimization that seeks to find the greatest amount of flow that can be sent from a source node to a sink node through a network while respecting capacity constraints on edges
The maximum flow problem is fundamental to network optimization and has applications in transportation and logistics.
O problema de fluxo máximo é fundamental para a otimização de redes e tem aplicações em transporte e logística.
2. In operations research, the task of determining the optimal routing of resources through a constrained network to maximize throughput
Engineers use the maximum flow problem to optimize data routing in telecommunications networks.
Engenheiros usam o problema de fluxo máximo para otimizar o roteamento de dados em redes de telecomunicações.
This is specialized technical terminology used primarily in academic and professional settings within computer science, operations research, and engineering. It is universally recognized in these fields across both English and Portuguese-speaking countries. The term is rarely used in casual conversation and is domain-specific to students and professionals in mathematics, computer science, and related fields.
Look up more words on Fala2Me
The free English-Portuguese dictionary with real Brazilian accents, NYC slang, conjugator and more
Open Fala2Me →