Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
  Browse All Reviews > Mathematics Of Computing (G) > Discrete Mathematics (G.2) > Combinatorics (G.2.1) > Combinatorial Algorithms (G.2.1...)  
 
Options:
 
  1-10 of 44 Reviews about "Combinatorial Algorithms (G.2.1...)": Date Reviewed
  Algorithm and symbolic combinatorics: an invitation to analytic combinatorics in several variables
Melczer S., Springer International Publishing, New York, NY, 2021. 436 pp.  Type: Book (978-3-030670-79-5)

Analytic combinatorics is a powerful branch of modern mathematics with several applications to physics and computer science, not to speak of mathematics itself. Melczer has done a good job of mathematically encompassing the issues rela...

Aug 17 2022
  Exploring the prediction of variety-seeking behavior
Li J., Zhao J., Mao M., Zhao X., Zou J.  DSIT 2019 (Proceedings of the 2nd International Conference on Data Science and Information Technology, Seoul, South Korea, Jul 19-21, 2019) 59-63, 2019.  Type: Proceedings

Modern marketing applies data analytics to determine measures that influence a customer’s future purchase decisions based on past behavior. One aspect of this behavior is that customers like to vary their purchases over time ...

Oct 23 2019
  A GPU-based branch-and-bound algorithm using IntegerVectorMatrix data structure
Gmys J., Mezmaz M., Melab N., Tuyttens D. Parallel Computing 59(C): 119-139, 2016.  Type: Article

Gmys et al. address the parallelization of the popular branch-and-bound (B&B) algorithm for solving combinatorial optimization problems using graphics processing units (GPUs). The irregular structure of B&B makes it challenging...

May 17 2017
  Combinatorial search: from algorithms to systems
Hamadi Y., Springer Publishing Company, Incorporated, New York, NY, 2013. 170 pp.  Type: Book (978-3-642414-81-7), Reviews: (2 of 2)

The focus of this book is knowledge sharing in combinatorial search, a topic that is of considerable current importance in the quest for solutions to NP-hard problems. Operations research professionals and computer scientists alike wil...

May 22 2014
  Combinatorial search: from algorithms to systems
Hamadi Y., Springer Publishing Company, Incorporated, New York, NY, 2013. 170 pp.  Type: Book (978-3-642414-81-7), Reviews: (1 of 2)

The main purpose of this book is to describe several aspects of combinatorial search algorithms and systems in a unified manner....

Jan 30 2014
  Rainbow cliques and the classification of small BLT-sets
Betten A.  ISSAC 2013 (Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation, Boston, MA, Jun 26-29, 2013) 53-60, 2013.  Type: Proceedings

A generalized quadrangle is a partial linear space satisfying the following axiom: for any non-incident point-line pair, there exists exactly one line incident with the point and meeting the line in a unique point. A generalized quadra...

Dec 3 2013
  Bioinspired computation in combinatorial optimization: algorithms and their computational complexity
Neumann F., Witt C., Springer-Verlag New York, Inc., New York, NY, 2010. 216 pp.  Type: Book (978-3-642165-43-6)

Biology has long inspired engineering and impacted technology. Recently, in fact, a new branch of natural information and communication technology (ICT) has emerged, thus bridging biology and engineering so that the communication of id...

May 19 2011
  A constraint on the biembedding of Latin squares
Lefevre J., Donovan D., Grannell M., Griggs T. European Journal of Combinatorics 30(2): 380-386, 2009.  Type: Article

Consider a set of n different symbols. A Latin square of order n is an n × n table, so that each symbol occurs exactly once in each row and each colu...

Jun 10 2009
  The art of computer programming, Volume 4, Fascicle 0: introduction to combinatorial algorithms and Boolean functions
Knuth D., Addison-Wesley Professional, 2008. 240 pp.  Type: Book (9780321534965), Reviews: (2 of 2)

Those not familiar with this body of work might be puzzled with the way this fascicle fits into the big picture. Knuth has made every effort to make this volume self-contained, making as few references as possible to the rest of the vo...

Nov 18 2008
  The art of computer programming, Volume 4, Fascicle 0: introduction to combinatorial algorithms and Boolean functions
Knuth D., Addison-Wesley Professional, 2008. 240 pp.  Type: Book (9780321534965), Reviews: (1 of 2)

[Ed. Note: This review is part of a series of reviews covering the recent updates to Donald Knuth’s seminal work, The art of computer programming. Please click the links at the end of the review to be taken to the r...

Sep 22 2008
 
 
 
Display per page
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 2004 Reviews.com™
Terms of Use
| Privacy Policy