The topics include: * Network flow problems * Optimal matching * Integrality of polyhedra * Matroids * NP-completeness Featuring logical and consistent exposition, clear explanations of basic and advanced concepts, many real-world examples, ...
Thus this book represents the state of the art of combinatorial optimization. This third edition contains a new chapter on facility location problems, an area which has been extremely active in the past few years.
This graduate-level text considers the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; local search heuristics for NP ...
New and elegant proofs of classical results and makes difficult results accessible.
Fertin, G., Labarre, A., Rusu, I., Tannier, E., Vialette, S.: Combinatorics of Genome Rearrangements. The MIT Press, Cambridge (2009) 11. Jiang, H., Zheng, C., Sankoff, D., Zhu, B.: Scaffold filling under the breakpoint distance.
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...
... boolean functions and equations 2 Boolean functions and boolean equations 3 Efficient graph - theoretic algorithms for solving quadratic boolean equations PART II ... Introduction The present survey is devoted to quadratic functions.
Theory and Algorithms Bernhard Korte, Jens Vygen. Note: This problem has been the subject of the first paper on ... Probabilistic and Experimental Methodologies; LNCS 4614 (Chen, B., Paterson, M., Zhang, G., eds.), Springer, Berlin 2007 ...