1.

Record Nr.

UNINA9910460962603321

Autore

Lau Lap Chi

Titolo

Iterative methods in combinatorial optimization / / Lap Chi Lau, R. Ravi, Mohit Singh [[electronic resource]]

Pubbl/distr/stampa

Cambridge : , : Cambridge University Press, , 2011

ISBN

1-107-22177-3

1-283-11116-0

9786613111166

1-139-07652-3

0-511-97715-8

1-139-08334-1

1-139-07880-1

1-139-08107-1

1-139-07080-0

Descrizione fisica

1 online resource (xi, 242 pages) : digital, PDF file(s)

Collana

Cambridge texts in applied mathematics ; ; 46

Disciplina

518/.26

Soggetti

Iterative methods (Mathematics)

Combinatorial optimization

Lingua di pubblicazione

Inglese

Formato

Materiale a stampa

Livello bibliografico

Monografia

Note generali

Title from publisher's bibliographic system (viewed on 05 Oct 2015).

Nota di bibliografia

Includes bibliographical references and index.

Nota di contenuto

Machine generated contents note: 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.

Sommario/riassunto

With the advent of approximation algorithms for NP-hard combinatorial optimization problems, several techniques from exact optimization such as the primal-dual method have proven their staying power and versatility. This book describes a simple and powerful method that is iterative in essence and similarly useful in a variety of settings for exact and approximate optimization. The authors highlight the commonality and uses of this method to prove a variety of classical polyhedral



results on matchings, trees, matroids and flows. The presentation style is elementary enough to be accessible to anyone with exposure to basic linear algebra and graph theory, making the book suitable for introductory courses in combinatorial optimization at the upper undergraduate and beginning graduate levels. Discussions of advanced applications illustrate their potential for future application in research in approximation algorithms.

2.

Record Nr.

UNISA996396033803316

Autore

Markham Gervase <1568?-1637.>

Titolo

The second booke of the English husbandman [[electronic resource] ] : Contayning the ordering of the kitchin-garden, and the planting of strange flowers: the breeding of all manner of cattell. Together with the cures, the feeding of cattell, the ordering both of pastures and meddow-ground: with the vse both of high-wood and vnder-wood. Whereunto is added a treatise, called Good mens recreation: contayning a discourse of the generall art of fishing, with the angle, and otherwise; and of all the hidden secrets belonging thereunto. Together vvith the choyce, ordering, breeding, and dyeting of the fighting cocke. A worke neuer written before by any author. By G.M

Pubbl/distr/stampa

London, : Printed by T[homas] S[nodham] for Iohn Browne, and are to be sould at his shop in St. Dunstanes Church-yard in Fleetstreet, 1615

Descrizione fisica

[16], 56, 59-205 [i.e. 105], [1]; [2], 51, [3] p

Altri autori (Persone)

DennysJohn <d. 1609.>

Soggetti

Fishing - England

Agriculture - England

Lingua di pubblicazione

Inglese

Formato

Materiale a stampa

Livello bibliografico

Monografia

Note generali

G.M. = Gervase Markham.

Printer's name from STC.

"The pleasures of princes, or Good mens recreations", a prose paraphrase with additions of "The secrets of angling" by John Dennys, has separate dated title page, pagination, and register.

The first leaf is blank except for signature-mark "A"; the last leaf is blank.

P. 105 misnumbered 205.



A variant (STC 17356a) has title pages dated 1615.

Reproduction of the original in the British Library.

Sommario/riassunto

eebo-0018