Title Iterative Methods in Combinatorial Optimization

Published Leiden : Cambridge University Press, 2011

Click on the following:
ProQuest Ebook Central

Copies

Description 1 online resource (256 pages) Series Cambridge Texts in Applied Mathematics Cambridge texts in applied mathematics. Contents Cover; Half-title; Series-title; Title; Copyright; Contents; Preface; 1 Introduction; 2 Preliminaries; 3 Matching and vertex cover in bipartite graphs; 4 Spanning trees; 5 Matroids; 6 Arborescence and rooted connectivity; 7 Submodular flows and applications; 8 Network matrices; 9 Matchings; 10 Network design; 11 Constrained optimization problems; 12 Cut problems; 13 Iterative relaxation: Early and recent examples; 14 Summary; Bibliography; Index Summary A simple, powerful method that is iterative and useful in a variety of settings for exact and approximate optimization Bibliography Includes bibliographical references and index Notes Print version record Subject Combinatorial optimization. Iterative methods (Mathematics) Combinatorial optimization Iterative methods (Mathematics) Form Electronic book Author Ravi, R Singh, Mohit ISBN 9781139083348 1139083341 9781139081078 1139081071

  Permalink