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.

Generi
Algorithms, Combinatorial optimization, Computational complexity, Matroids, Network analysis (Planning), Mathematical optimization
Autore
Eugene L. Lawler
Pagine
379

Dove trovarlo

Amazon ↗

Alcuni collegamenti sono di affiliazione: se acquisti, il sito può ricevere una commissione, senza costi in più per te.

Non sai cosa scegliere?

Dimmi i tuoi gusti e ti propongo cosa leggere, in base a quello che ti piace.

Provalo gratis

Titoli simili

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)