Narrow your search

Library

ULB (15)

KU Leuven (12)

Thomas More Kempen (10)

Thomas More Mechelen (10)

ULiège (10)

VIVES (10)

Odisee (9)

UCLL (9)

AP (8)

KDG (8)

More...

Resource type

book (25)

digital (8)


Language

English (25)

German (3)

Italian (3)

French (2)


Year
From To Submit

2024 (1)

2018 (2)

2016 (3)

2014 (2)

2012 (5)

More...
Listing 1 - 10 of 33 << page
of 4
>>
Sort by

Book
Combinatorial Optimization : Theory and Algorithms
Authors: ---
ISSN: 09375511 ISBN: 3540292977 Year: 2006 Volume: 21 Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

This comprehensive textbook on combinatorial optimization puts special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It has arisen as the basis of several courses on combinatorial optimization and more special topics at graduate level. Since the complete book contains enough material for at least four semesters (4 hours a week), one usually selects material in a suitable way. The book contains complete but concise proofs, also for many deep results, some of which did not appear in a book before. Many very recent topics are covered as well, and many references are provided. 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. Furthermore there are several new sections and further material on various topics. New exercises and updates in the bibliography were added. From the reviews of the 2nd edition: "This book on combinatorial optimization is a beautiful example of the ideal textbook." Operations Research Letters 33 (2005), p.216-217 "The second edition (with corrections and many updates) of this very recommendable book documents the relevant knowledge on combinatorial optimization and records those problems and algorithms that define this discipline today. To read this is very stimulating for all the researchers, practitioners, and students interested in combinatorial optimization." OR News 19 (2003), p.42 .

Combinatorial Optimization : Theory and Algorithms
Authors: ---
ISBN: 3642090923 3540718435 3540718443 Year: 2008 Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It has arisen as the basis of several courses on combinatorial optimization and more special topics at graduate level. It contains complete but concise proofs, also for many deep results, some of which did not appear in a textbook before. Many very recent topics are covered as well, and many references are provided. Thus this book represents the state of the art of combinatorial optimization. This fourth edition is again significantly extended, most notably with new material on linear programming, the network simplex algorithm, and the max-cut problem. Many further additions and updates are included as well. From the reviews of the previous editions: "This book on combinatorial optimization is a beautiful example of the ideal textbook." Operations Research Letters 33 (2005), p.216-217 "The second edition (with corrections and many updates) of this very recommendable book documents the relevant knowledge on combinatorial optimization and records those problems and algorithms that define this discipline today. To read this is very stimulating for all the researchers, practitioners, and students interested in combinatorial optimization." OR News 19 (2003), p.42 "... has become a standard textbook in the field." Zentralblatt MATH 1099.90054.

Keywords

Combinatorial optimization. --- Electronic books. -- local. --- Mathematical optimization. --- Algebra --- Operations Research --- Civil & Environmental Engineering --- Mathematics --- Engineering & Applied Sciences --- Physical Sciences & Mathematics --- Optimization (Mathematics) --- Optimization techniques --- Optimization theory --- Systems optimization --- Optimization, Combinatorial --- Mathematics. --- Operations research. --- Decision making. --- Computer science --- Mathematical models. --- Calculus of variations. --- Discrete mathematics. --- Combinatorics. --- Discrete Mathematics. --- Mathematical Modeling and Industrial Mathematics. --- Calculus of Variations and Optimal Control; Optimization. --- Mathematics of Computing. --- Operation Research/Decision Theory. --- Combinatorics --- Mathematical analysis --- Computer mathematics --- Discrete mathematics --- Electronic data processing --- Isoperimetrical problems --- Variations, Calculus of --- Maxima and minima --- Models, Mathematical --- Simulation methods --- Deciding --- Decision (Psychology) --- Decision analysis --- Decision processes --- Making decisions --- Management --- Management decisions --- Choice (Psychology) --- Problem solving --- Operational analysis --- Operational research --- Industrial engineering --- Management science --- Research --- System theory --- Math --- Science --- Decision making --- Operations research --- System analysis --- Combinatorial analysis --- Mathematical optimization --- Computer science. --- Operations Research/Decision Theory. --- Informatics --- Computer science—Mathematics. --- Discrete mathematical structures --- Mathematical structures, Discrete --- Structures, Discrete mathematical --- Numerical analysis


Book
Combinatorial Optimization : Theory and Algorithms
Authors: ---
ISBN: 3642244874 3642244882 Year: 2012 Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some of which have not appeared in a textbook before. Throughout, it contains complete but concise proofs, and also provides numerous exercises and references. This fifth edition has again been updated, revised, and significantly extended, with more than 60 new exercises and new material on various topics, including Cayley's formula, blocking flows, faster b-matching separation, multidimensional knapsack, multicommodity max-flow min-cut ratio, and sparsest cut. Thus, this book represents the state of the art of combinatorial optimization. From the reviews of the previous editions: "This book on combinatorial optimization is a beautiful example of the ideal textbook." Operations Research Letters 33 (2005) "..... this very recommendable book documents the relevant knowledge on combinatorial optimization and records those problems and algorithms that define this discipline today. To read this is very stimulating for all the researchers, practitioners, and students interested in combinatorial optimization." OR News 19 (2003) "... has become a standard textbook in the field." Zentralblatt MATH 1099.90054  "...gives an excellent comprehensive view of the exciting field of combinatorial optimization."  Zentralblatt MATH 1149.90126.


Book
Ottimizzazione Combinatoria : Teoria e Algoritmi
Authors: ---
ISBN: 8847015227 8847015235 Year: 2011 Publisher: Milano : Springer Milan : Imprint: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Questo libro di testo di ottimizzazione combinatoria pone in particolare risalto i risultati teorici e gli algoritmi che, al contrario delle euristiche, hanno una garanzia di avere buone prestazioni. Comprende una vasta scelta di argomenti e nasce come riferimento di diversi corsi di ottimizzazione combinatoria sia di base che di livello avanzato. Il libro contiene dimostrazioni complete (ma concise) anche di molti risultati avanzati, alcuni dei quali non sono mai apparsi prima in un libro. Vengono anche trattati molti dei temi di ricerca più attuali e sono riportati molti riferimenti alla letteratura. Quindi questo libro, traduzione della quarta edizione in lingua originale, rappresenta lo stato dell’arte dell’ottimizzazione combinatoria.

Combinatorial optimization : theory and algorithms.
Authors: ---
ISSN: 09375511 ISBN: 3540256849 9783540256847 3540292977 Year: 2006 Volume: 21 Publisher: Berlin Springer

Loading...
Export citation

Choose an application

Bookmark

Abstract

This comprehensive textbook on combinatorial optimization puts special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It has arisen as the basis of several courses on combinatorial optimization and more special topics at graduate level. Since the complete book contains enough material for at least four semesters (4 hours a week), one usually selects material in a suitable way. The book contains complete but concise proofs, also for many deep results, some of which did not appear in a book before. Many very recent topics are covered as well, and many references are provided. 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. Furthermore there are several new sections and further material on various topics. New exercises and updates in the bibliography were added. From the reviews of the 2nd edition: "This book on combinatorial optimization is a beautiful example of the ideal textbook." Operations Resarch Letters 33 (2005), p.216-217 "The second edition (with corrections and many updates) of this very recommendable book documents the relevant knowledge on combinatorial optimization and records those problems and algorithms that define this discipline today. To read this is very stimulating for all the researchers, practitioners, and students interested in combinatorial optimization." OR News 19 (2003), p.42 .


Book
Algorithmic Mathematics
Authors: ---
ISBN: 3319395580 3319395572 Year: 2016 Publisher: Cham : Springer International Publishing : Imprint: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Algorithms play an increasingly important role in nearly all fields of mathematics. This book allows readers to develop basic mathematical abilities, in particular those concerning the design and analysis of algorithms as well as their implementation. It presents not only fundamental algorithms like the sieve of Eratosthenes, the Euclidean algorithm, sorting algorithms, algorithms on graphs, and Gaussian elimination, but also discusses elementary data structures, basic graph theory, and numerical questions. In addition, it provides an introduction to programming and demonstrates in detail how to implement algorithms in C++. This textbook is suitable for students who are new to the subject and covers a basic mathematical lecture course, complementing traditional courses on analysis and linear algebra. Both authors have given this "Algorithmic Mathematics" course at the University of Bonn several times in recent years.


Book
Combinatorial Optimization : Theory and Algorithms
Authors: ---
ISBN: 3662560399 3662560380 Year: 2018 Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some of which have not appeared in a textbook before. Throughout, it contains complete but concise proofs, and also provides numerous exercises and references. This sixth edition has again been updated, revised, and significantly extended. Among other additions, there are new sections on shallow-light trees, submodular function maximization, smoothed analysis of the knapsack problem, the (ln 4+ɛ)-approximation for Steiner trees, and the VPN theorem. Thus, this book continues to represent the state of the art of combinatorial optimization. From the reviews of the previous editions: “This book on combinatorial optimization is a beautiful example of the ideal textbook.” Operations Research Letters 33 (2005) “This is the 5th edition of one of the standard books in combinatorial optimization. It is an excellent book covering everything from the basics up to the most advanced topics (graduate level and current research). It provides theoretical results, underlying ideas, algorithms and the needed basics in graph theory in a very nice, comprehensive way. The book also provides insights into and pointers to adjacent areas that could not be covered in full length for the interested reader. “Combinatorial Optimization” can easily serve as an (almost) complete reference for current research and is state-of-the-art. […]” Zentralblatt MATH 1237.90001 .


Book
Integer Programming and Combinatorial Optimization : 17th International Conference, IPCO 2014, Bonn, Germany, June 23-25, 2014, Proceedings
Authors: ---
ISBN: 331907556X 3319075578 Year: 2014 Publisher: Cham : Springer International Publishing : Imprint: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

This book constitutes the refereed proceedings of the 17th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2014, held in Bonn, Germany, in June 2014. The 34 full papers presented were carefully reviewed and selected from 143 submissions. The conference is a forum for researchers and practitioners working on various aspects of integer programming and combinatorial optimization. The aim is to present recent developments in theory, computation, and applications in these areas. The scope of IPCO is viewed in a broad sense, to include algorithmic and structural results in integer programming and combinatorial optimization as well as revealing computational studies and novel applications of discrete optimization to practical problems.


Digital
Combinatorial Optimization : Theory and Algorithms
Authors: ---
ISBN: 9783540292975 Year: 2006 Publisher: Berlin, Heidelberg Springer-Verlag Berlin Heidelberg

Loading...
Export citation

Choose an application

Bookmark

Abstract


Digital
Combinatorial Optimization : Theory and Algorithms
Authors: ---
ISBN: 9783540718444 Year: 2008 Publisher: Berlin, Heidelberg Springer-Verlag Berlin Heidelberg

Loading...
Export citation

Choose an application

Bookmark

Abstract

Listing 1 - 10 of 33 << page
of 4
>>
Sort by