Limone Time
Combinatorial optimization

Combinatorial optimization

Libro (1975)

Perceptively written text examines optimization problems that can be formulated in terms of networks and algebraic structures called matroids. Chapters cover shortest paths, network flows, bipartite matching, nonbipartite matching, matroids and the greedy algorithm, matroid intersections, and the matroid parity problems. A suitable text or reference for courses in combinatorial computing.

Géneros
Algorithms, Combinatorial optimization, Computational complexity, Matroids, Network analysis (Planning), Mathematical optimization
Autor
Eugene L. Lawler
Páginas
379

Dónde encontrarlo

Amazon ↗

Algunos enlaces son de afiliación: si compras, el sitio puede recibir una comisión, sin coste adicional para ti.

¿No sabes qué elegir?

Dime lo que te gusta y te propongo qué leer según tus gustos.

Pruébalo gratis

Títulos parecidos

Graphs, algorithms, and optimization (2004)Computer Algebra in Scientific Computing (2009)The art of computer programming (1922)Computer Networks (1981)Advances in Swarm Intelligence (2012)JavaScript: The Definitive Guide (1996)QualityLand (2017)Introduction to Algorithms (1990)