An n-tet graph approach for non-guillotine packings of n-dimensional boxes into an n-container.
Lauro LinsSóstenes LinsReinaldo MorabitoPublished in: Eur. J. Oper. Res. (2002)
Keyphrases
- graph representation
- multi dimensional
- packing problem
- random walk
- graph model
- graph structure
- graph theory
- weighted graph
- stable set
- graph theoretic
- undirected graph
- connected components
- neural network
- bipartite graph
- directed graph
- link analysis
- directed acyclic graph
- graph mining
- real time
- knapsack problem
- web graph
- optimization problems
- pairwise
- data structure
- dimensional data
- graph construction
- adjacency matrix
- graph matching