| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNINA990004216840403321 |
|
|
Autore |
Gray, Thomas <1716-1771> |
|
|
Titolo |
The Poems / of Thomas Gray, William Collins, Oliver Goldsmith ; edited by Roger Lonsdale |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
|
|
|
|
Descrizione fisica |
|
XVIII, 774 p. : 4 tav. ; 22 cm |
|
|
|
|
|
|
Collana |
|
Longmans annotated english poets |
|
|
|
|
|
|
Altri autori (Persone) |
|
Collins, William |
Goldsmith, Oliver |
|
|
|
|
|
|
|
|
Locazione |
|
|
|
|
|
|
Collocazione |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
|
|
|
|
|
|
|
2. |
Record Nr. |
UNINA9910143921303321 |
|
|
Titolo |
Computational Combinatorial Optimization : Optimal or Provably Near-Optimal Solutions / / edited by Michael Jünger, Denis Naddef |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2001.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (X, 310 p.) |
|
|
|
|
|
|
Collana |
|
Lecture Notes in Computer Science, , 0302-9743 ; ; 2241 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Mathematical optimization |
Computer science—Mathematics |
Algorithms |
Information technology |
Business—Data processing |
Data structures (Computer science) |
Combinatorial analysis |
Optimization |
Discrete Mathematics in Computer Science |
Algorithm Analysis and Problem Complexity |
IT in Business |
Data Structures |
Combinatorics |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references at the end of each chapters and index. |
|
|
|
|
|
|
|
|
Nota di contenuto |
|
General Mixed Integer Programming: Computational Issues for Branch-and-Cut Algorithms -- Projection and Lifting in Combinatorial Optimization -- Mathematical Programming Models and Formulations for Deterministic Production Planning Problems -- Lagrangian Relaxation -- Branch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS -- Branch, Cut, and Price: Sequential and Parallel -- TSP Cuts Which Do Not Conform to the Template Paradigm. |
|
|
|
|
|
|
|
|
|
|
|
|
|
Sommario/riassunto |
|
This tutorial contains written versions of seven lectures on Computational Combinatorial Optimization given by leading members of the optimization community. The lectures introduce modern combinatorial optimization techniques, with an emphasis on branch and cut algorithms and Lagrangian relaxation approaches. Polyhedral combinatorics as the mathematical backbone of successful algorithms are covered from many perspectives, in particular, polyhedral projection and lifting techniques and the importance of modeling are extensively discussed. Applications to prominent combinatorial optimization problems, e.g., in production and transport planning, are treated in many places; in particular, the book contains a state-of-the-art account of the most successful techniques for solving the traveling salesman problem to optimality. |
|
|
|
|
|
|
|
| |