October 2024
Intermediate to advanced
390 pages
10h 52m
Spanish
Content preview from Algoritmos en pocas palabras, 2ª edición
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.
Capítulo 8. Algoritmos de flujo de red
Este trabajo se ha traducido utilizando IA. Agradecemos tus opiniones y comentarios: translation-feedback@oreilly.com
Muchos problemas pueden presentarse como una red de vértices y perímetros, con una capacidad asociada a cada perímetro por el que fluyen mercancías. Los algoritmos de este capítulo surgen de la necesidad de resolver estas clases específicas de problemas. Ahuja (1993) contiene un amplio análisis de numerosas aplicaciones de los algoritmos de flujo de red:
- Asignación
-
Dado un conjunto de tareas a realizar y un conjunto de empleados, que pueden costar distintas cantidades en función de la tarea asignada, asigna los empleados a las tareas minimizando el gasto total.
- Emparejamiento bipartito
-
Dado un conjunto de candidatos que han sido entrevistados para un conjunto de puestos vacantes, encuentra un emparejamiento que maximice el número de candidatos seleccionados para puestos de trabajo para los que están cualificados.
- Caudal máximo
-
Dada una red que muestra la capacidad potencial de transporte de mercancías entre dos lugares, calcula el flujo máximo soportado por la red.
- Transporte
-
Determina la forma más rentable de enviar mercancías desde un conjunto de fábricas proveedoras a un conjunto de tiendas minoristas.
- Transbordo
-
Determinar la forma más rentable de enviar mercancías desde un conjunto de fábricas proveedoras a un conjunto de tiendas minoristas, utilizando potencialmente un conjunto de almacenes como estaciones de ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access
More than 5,000 organizations count on O’Reilly
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.Julian F.
I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.Addison B.
I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.Amir M.
I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.