Finding all k-cliques in k-partite graphs, an application in textile engineering Export

@article{grunert:cliques, abstract = {In many practical cases one has to choose an arrangement of different objects so that they are compatible. Whenever the compatibility of the objects can be checked by a pair-wise comparison the problem can be modelled using the graph-theoretic notion of cliques. We consider a special case of the problem where the objects can be grouped so that exactly one object in every group has to be chosen. This object has to be compatible to every other object selected from the other groups. The problem was motivated by a braiding application from textile technology. The task is to route a set of thread-spools (bobbins) on a machine from their origins to their destinations so that collisions are avoided. We present a new model and algorithm in order to solve this important practical problem.Scope and purpose An important contribution of Operations Research is to develop computer-based tools for assistance in decision making. In this paper we show how techniques from combinatorial optimization can assist textile engineers in finding a control of a newly developed braiding machine. We have developed new models and have employed shortest path algorithms (Ahuja RK, Magnanti TL, Orlin JB. Network flows, theory, algorithms, and applications, Englewood Cliffs, NJ: Prentice-Hall, 1993. p. 93-165), and a branch and bound algorithm for the maximum clique problem (Johnson DS, Trick MA, (editors). Cliques, coloring, and satisfiability, DIMACS Series in discrete mathematics and theoretical computer science, Providence, RI: American Mathematical Society, 1996.) to compute controls. The determination of controls is a highly complex task, which can take days or even weeks if performed manually. Hence, computer-assistance is a necessity in practice. Indeed, the tools we have developed are employed in practice and have increased productivity enormously.}, author = {Gr\"{u}nert, Tore and Irnich, Stefan and Zimmermann, Hans-J\"{u}rgen and Schneider, Markus and Wulfhorst, Burkhard}, citeulike-article-id = {2898798}, citeulike-linkout-0 = {http://dx.doi.org/10.1016/S0305-0548(00)00053-8}, citeulike-linkout-1 = {http://www.sciencedirect.com/science/article/B6VC5-43RCPW7-2/1/688760306c966f64d0bfc1744c2bcf15}, comment = {Looked at as a reference for Mercator, which finds cliques in k-partite graphs.}, doi = {10.1016/S0305-0548(00)00053-8}, journal = {Computers \& Operations Research}, keywords = {clique, graph, k-partite}, month = {January}, number = {1}, pages = {13--31}, posted-at = {2008-06-16 15:37:57}, priority = {2}, title = {Finding all k-cliques in k-partite graphs, an application in textile engineering}, url = {http://dx.doi.org/10.1016/S0305-0548(00)00053-8}, volume = {29}, year = {2002} }

TY - JOUR ID - grunert:cliques L3 - citeulike-article-id:2898798 N2 - In many practical cases one has to choose an arrangement of different objects so that they are compatible. Whenever the compatibility of the objects can be checked by a pair-wise comparison the problem can be modelled using the graph-theoretic notion of cliques. We consider a special case of the problem where the objects can be grouped so that exactly one object in every group has to be chosen. This object has to be compatible to every other object selected from the other groups. The problem was motivated by a braiding application from textile technology. The task is to route a set of thread-spools (bobbins) on a machine from their origins to their destinations so that collisions are avoided. We present a new model and algorithm in order to solve this important practical problem.Scope and purpose An important contribution of Operations Research is to develop computer-based tools for assistance in decision making. In this paper we show how techniques from combinatorial optimization can assist textile engineers in finding a control of a newly developed braiding machine. We have developed new models and have employed shortest path algorithms (Ahuja RK, Magnanti TL, Orlin JB. Network flows, theory, algorithms, and applications, Englewood Cliffs, NJ: Prentice-Hall, 1993. p. 93-165), and a branch and bound algorithm for the maximum clique problem (Johnson DS, Trick MA, (editors). Cliques, coloring, and satisfiability, DIMACS Series in discrete mathematics and theoretical computer science, Providence, RI: American Mathematical Society, 1996.) to compute controls. The determination of controls is a highly complex task, which can take days or even weeks if performed manually. Hence, computer-assistance is a necessity in practice. Indeed, the tools we have developed are employed in practice and have increased productivity enormously. IS - 1 JF - Computers & Operations Research EP - 31 TI - Finding all k-cliques in k-partite graphs, an application in textile engineering VL - 29 SP - 13 KW - clique KW - graph KW - k-partite N1 - Looked at as a reference for Mercator, which finds cliques in k-partite graphs. AU - Grünert, Tore AU - Irnich, Stefan AU - Zimmermann, Hans-Jürgen AU - Schneider, Markus AU - Wulfhorst, Burkhard PY - 2002/01// UR - http://dx.doi.org/10.1016/S0305-0548(00)00053-8 ER -