Combinatorial problems based on graph partitioning enable us to mathematically represent and model many practical applications. Mission planning and the routing problems occurring in logistics perfectly illustrate two such examples. Nevertheless, these problems are not based on the same partitioning pattern: generally, patterns like cycles, paths, or trees are distinguished. Moreover, the practical applications are often not limited to theoretical problems like the Hamiltonian path problem, or K-node disjoint path problems. Indeed, they usually combine the graph partitioning problem with several restrictions related to the topology of nodes and arcs. The diversity of implied constraints in real-life applications is a practical limit to the resolution of such problems by approaches considering the partitioning problem independently from each additional restriction.
This book focuses on constraint satisfaction problems related to tree partitioning problems enriched by several additional constraints that restrict the possible partitions topology. On the one hand, this title focuses on the structural properties of tree partitioning constraints. On the other hand, it is dedicated to the interactions between the tree partitioning problem and classical restrictions (such as precedence relations or incomparability relations between nodes) involved in practical applications.
Precisely, Tree-based Graph Partitioning Constraint shows how to globally take into account several restrictions within one single tree partitioning constraint. Another interesting aspect of this book is related to the implementation of such a constraint. In the context of graph-based global constraints, the book illustrates how a fully dynamic management of data structures makes the runtime of filtering algorithms independent of the graph density.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Xavier Lorca is Associate Professor of Computer Science at the Ecole des Mines de Nantes in France and manages its research activities on Constraint Programming at the CNRS research lab LINA. Prior to his current position, he obtained his PhD in Constraint Programming from the University of Nantes in 2007.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Vendeur : Studibuch, Stuttgart, Allemagne
hardcover. Etat : Sehr gut. 240 Seiten; 9781848213036.2 Gewicht in Gramm: 1. N° de réf. du vendeur 1087496
Quantité disponible : 1 disponible(s)
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Etat : New. N° de réf. du vendeur 12571536-n
Quantité disponible : 19 disponible(s)
Vendeur : INDOO, Avenel, NJ, Etats-Unis
Etat : New. Brand New. N° de réf. du vendeur 9781848213036
Quantité disponible : Plus de 20 disponibles
Vendeur : Books Puddle, Woodside, NY, Etats-Unis
Etat : New. pp. x + 240. N° de réf. du vendeur 263599257
Quantité disponible : 1 disponible(s)
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Etat : As New. Unread book in perfect condition. N° de réf. du vendeur 12571536
Quantité disponible : 19 disponible(s)
Vendeur : Majestic Books, Hounslow, Royaume-Uni
Etat : New. pp. x + 240 Illus. N° de réf. du vendeur 4281414
Quantité disponible : 1 disponible(s)
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
Etat : As New. Unread book in perfect condition. N° de réf. du vendeur 12571536
Quantité disponible : Plus de 20 disponibles
Vendeur : Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlande
Etat : New. Combinatorial problems based on graph partitioning enable us to mathematically represent and model many practical applications. Mission planning and the routing problems occurring in logistics perfectly illustrate two such examples. Num Pages: 250 pages, Illustrations. BIC Classification: PBT; UMN. Category: (G) General (US: Trade). Dimension: 162 x 237 x 27. Weight in Grams: 606. . 2011. . . . . N° de réf. du vendeur V9781848213036
Quantité disponible : 15 disponible(s)
Vendeur : Ubiquity Trade, Miami, FL, Etats-Unis
Etat : New. Brand new! Please provide a physical shipping address. N° de réf. du vendeur 9781848213036
Quantité disponible : Plus de 20 disponibles
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
Etat : New. N° de réf. du vendeur 12571536-n
Quantité disponible : Plus de 20 disponibles