Handle-rewriting hypergraph grammars
Journal of Computer and System Sciences
k-NLC graphs and polynomial algorithms
Discrete Applied Mathematics - Special issue: efficient algorithms and partial k-trees
Cardinality-restricted chains and antichains in partially ordered sets
Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
Theoretical Computer Science
Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms
SIAM Journal on Computing
Upper bounds to the clique width of graphs
Discrete Applied Mathematics
How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
The mutual exclusion scheduling problem for permutation and comparability graphs
Information and Computation
Branch-And-Price: Column Generation for Solving Huge Integer Programs
Operations Research
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
New Graph Classes of Bounded Clique-Width
Theory of Computing Systems
| Hi-index | 0.00 |
In this paper we discuss a special pallet-loading problem, which we encountered at a manufacturing company. In graph-theoretical terms, the problem is equivalent to partitioning a permutation graph into bounded-size cliques. We formulate the problem as an integer program, and present two exact algorithms for solving it. The first algorithm is a branch-and-price algorithm based on the integer-programming formulation; the second one is an algorithm based on the concept of bounded clique width. The latter algorithm was motivated by the structure present in the real-world instances. Test results are given, both for real-world instances and randomly generated instances. As far as we are aware, this is the first implementation of an algorithm based on bounded clique width.