Narrow your search

Library

KU Leuven (11)

Odisee (10)

Thomas More Kempen (10)

Thomas More Mechelen (10)

UCLL (10)

ULiège (10)

VIVES (10)

ULB (8)

UGent (7)

AP (4)

More...

Resource type

book (19)

digital (4)


Language

English (23)


Year
From To Submit

2022 (2)

2021 (1)

2017 (2)

2015 (2)

2008 (4)

More...
Listing 1 - 10 of 23 << page
of 3
>>
Sort by

Book
Combinatorial Optimization and Applications : 15th International Conference, COCOA 2021, Tianjin, China, December 17–19, 2021, Proceedings
Author:
ISBN: 3030926818 303092680X Year: 2021 Publisher: Cham : Springer International Publishing : Imprint: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

This book constitutes the refereed proceedings of the 15th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2021, which took place in Tianjin, China, during December 17-19, 2021. The 55 papers presented in this volume were carefully reviewed and selected from 122 submissions. They deal with combinatorial optimization and its applications in general, focusing on algorithms design, theoretical and experimental analysis, and applied research of general algorithmic interest.


Book
Introduction to Combinatorial Optimization
Author:
ISBN: 303110594X 3031105966 Year: 2022 Publisher: Cham : Springer International Publishing : Imprint: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Introductory courses in combinatorial optimization are popular at the upper undergraduate/graduate levels in computer science, industrial engineering, and business management/OR, owed to its wide applications in these fields. There are several published textbooks that treat this course and the authors have used many of them in their own teaching experiences. This present text fills a gap and is organized with a stress on methodology and relevant content, providing a step-by-step approach for the student to become proficient in solving combinatorial optimization problems. Applications and problems are considered via recent technology developments including wireless communication, cloud computing, social networks, and machine learning, to name several, and the reader is led to the frontiers of combinatorial optimization. Each chapter presents common problems, such as minimum spanning tree, shortest path, maximum matching, network flow, set-cover, as well as key algorithms, such as greedy algorithm, dynamic programming, augmenting path, and divide-and-conquer. Historical notes, ample exercises in every chapter, strategically placed graphics, and an extensive bibliography are amongst the gems of this textbook.


Book
Theory and applications of models of computation : 17th annual conference, TAMC 2022, Tianjin, China, September 16-18, 2022, proceedings
Author:
ISBN: 303120350X 3031203496 Year: 2022 Publisher: Cham, Switzerland : Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Pooling designs and nonadaptive group testing : important tools for DNA sequencing
Authors: ---
ISBN: 1281924784 9786611924782 9812773460 9789812773463 9789812568229 9812568220 9812568220 Year: 2006 Publisher: New Jersey : World Scientific,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Pooling designs have been widely used in various aspects of DNA sequencing. In biological applications, the well-studied mathematical problem called "group testing" shifts its focus to nonadaptive algorithms while the focus of traditional group testing is on sequential algorithms. Biological applications also bring forth new models not previously considered, such as the error-tolerant model, the complex model, and the inhibitor model. This book is the first attempt to collect all the significant research on pooling designs in one convenient place. The coverage includes many real biological a

Steiner tree problems in computer communication networks
Authors: ---
ISBN: 1281933945 9786611933944 9812791450 9789812791450 9812791442 9789812791443 9781281933942 Year: 2008 Publisher: Singapore ; Hackensack, NJ : World Scientific,

Loading...
Export citation

Choose an application

Bookmark

Abstract

The Steiner tree problem is one of the most important combinatorial optimization problems. It has a long history that can be traced back to the famous mathematician Fermat (1601-1665). This book studies three significant breakthroughs on the Steiner tree problem that were achieved in the 1990's, and some important applications of Steiner tree problems in computer communication networks researched in the past fifteen years. It not only covers some of the most recent developments in Steiner tree problems, but also discusses various combinatorial optimization methods, thus providing a balance between theory and practice.

Combinatorics, computing and complexity
Authors: ---
ISBN: 0792303083 Year: 1989 Publisher: Dordrecht : Kluwer,

Loading...
Export citation

Choose an application

Bookmark

Abstract


Digital
Algorithms and Computation (vol. # 3827) : 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings
Authors: ---
ISBN: 9783540324263 Year: 2005 Publisher: Berlin Heidelberg Springer-Verlag GmbH


Book
Advances in optimization and approximation.
Authors: ---
ISBN: 9780792327851 Year: 1994 Publisher: Dordrecht Kluwer

Loading...
Export citation

Choose an application

Bookmark

Abstract

Algorithms and computation. 5th international symposium, ISAAC'94, Beijing, P.R. China, August 1994. Proceedings
Authors: ---
ISBN: 0387583254 3540583254 3540486534 Year: 1994 Volume: 834 Publisher: Berlin : Springer-Verlag,

Loading...
Export citation

Choose an application

Bookmark

Abstract

This volume is the proceedings of the fifth International Symposium on Algorithms and Computation, ISAAC '94, held in Beijing, China in August 1994. The 79 papers accepted for inclusion in the volume after a careful reviewing process were selected from a total of almost 200 submissions. Besides many internationally renowned experts, a number of excellent Chinese researchers present their results to the international scientific community for the first time here. The volume covers all relevant theoretical and many applicational aspects of algorithms and computation.

Handbook of combinatorial optimization.
Authors: ---
ISBN: 0387238298 1441936661 9786610190331 1280190337 0387238301 Year: 1999 Publisher: Dordrecht ; Boston : Kluwer Academic Publishers,

Loading...
Export citation

Choose an application

Bookmark

Abstract

This is a supplementary volume to the major three-volume Handbook of Combinatorial Optimization set, as well as the Supplement Volume A. It can also be regarded as a stand-alone volume which presents chapters dealing with various aspects of the subject, including optimization problems and algorithmic approaches for discrete problems. Audience This handbook is suitable for all those who use combinatorial optimization methods to model and solve problems.

Listing 1 - 10 of 23 << page
of 3
>>
Sort by