No label defined (Q4382664)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1131473
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1131473 |
Statements
22 March 1998
0 references
Combinatorial optimization
0 references
annotated bibliographies
0 references
0.9235442
0 references
0.89911187
0 references
0.88350505
0 references
0.8823145
0 references
0.87661684
0 references
0.87613773
0 references
0.87613773
0 references
0.8733662
0 references
[The contributions of this volume will be announced individually.] This book presents annotated bibliographies on important topics within the field of combinatorial optimization. However, the book offers much more than a pure bibliography as each chapter provides a concise, comprehensive and fully up-to-date survey of that area. The 24 chapters, all by leading experts, cover both method and application oriented subjects. In addition there are many sections on available software and an initial chapter reviewing the most influential texts of the last decade. The contents in detail: \textit{F. Maffioli}, \textit{S. Martello}: Selected books in and around combinatorial optimization, 1-12; \textit{V. Kann}, \textit{A. Panconesi}: Hardness of approximation, 13-30; \textit{K. Aardal}, \textit{R. Weismantel}: Polyhedral combinatorics, 31-44; \textit{A. Caprara}, \textit{M. Fischetti}: Branch-and-cut algorithms, 45-64; \textit{A. Frank}: Matroids and submodular functions, 65-80; \textit{M. Conforti}, \textit{G. Cornuéjols}, \textit{A. Kapoor}, \textit{K. Vušković}: Perfect, ideal and balanced matrices, 81-94; \textit{C. Roos}, \textit{T. Terlaky}: Advances in linear optimization, 95-114; \textit{F. Soumis}: Decomposition and column generation, 115-126; \textit{L. Stougie}, \textit{M. H. van der Vlerk}: Stochastic integer programming, 127-142; \textit{M. Goemans}, \textit{D. Karger}, \textit{J. Kleinberg}: Randomized algorithms, 143-162; \textit{E. Aarts}, \textit{M. Verhoeven}: Local search, 163-180; \textit{J. A. Hoogeveen}, \textit{J. K. Lenstra}, \textit{S. L. van de Velde}: Sequencing and scheduling, 181-198; \textit{M. Jünger}, \textit{G. Reinelt}, \textit{G. Rinaldi}: The traveling salesman problem, 199-222; \textit{G. Laporte}: Vehicle routing, 223-240; \textit{M. Laurent}: Max-cut problem, 241-260; \textit{M. Labbé}, \textit{F. V. Louveaux}: Location problems, 261-282; \textit{R. K. Ahuja}: Flows and paths, 283-310; \textit{A. Balakrishnan}, \textit{T. L. Magnanti}, \textit{P. Mirchandani}: Network design, 311-334; \textit{S. Raghavan}, \textit{T. L. Magnanti}: Network connectivity, 335-354; \textit{M. Dell'Amico}, \textit{S. Martello}: Linear assignment, 355-372; \textit{R. E. Burkard}, \textit{E. Çela}: Quadratic and three-dimensional assignments, 373-392; \textit{H. Dyckhoff}, \textit{G. Scheithauer}, \textit{J. Terno}: Cutting and packing, 393-414; \textit{S. Ceria}, \textit{P. Nobili}, \textit{A. Sassano}: Set covering problem, 415-428; \textit{R. H. Möhring}, \textit{D. Wagner}: Combinatorial topics in VLSI design, 429-444; \textit{M. Vingron}, \textit{H.-P. Lenhof}, \textit{P. Mutzel}: Computational molecular biology, 445-472.
0 references