Sciweavers

1221 search results - page 140 / 245
» Balanced graph partitioning
Sort
View
COR
2007
79views more  COR 2007»
13 years 10 months ago
Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem
We consider in this paper a new lagrangean relaxation with clusters for the Manufacturer’s Pallet Loading Problem (MPLP). The relaxation is based on the MPLP formulated as a Max...
Glaydston Mattos Ribeiro, Luiz Antonio Nogueira Lo...
NN
2006
Springer
127views Neural Networks» more  NN 2006»
13 years 10 months ago
Assessing self organizing maps via contiguity analysis
- Contiguity Analysis is a straightforward generalization of Linear Discriminant Analysis in which the partition of elements is replaced by a more general graph structure. Applied ...
Ludovic Lebart
SIAMDM
2008
84views more  SIAMDM 2008»
13 years 10 months ago
Long Local Searches for Maximal Bipartite Subgraphs
Given a partition of the vertices of a graph into two sets, a flip is a move of a vertex from its own set to the other, under the condition that it has more incident edges to vert...
Hemanshu Kaul, Douglas B. West
CORR
2007
Springer
118views Education» more  CORR 2007»
13 years 9 months ago
Contains and Inside relationships within combinatorial Pyramids
7 Irregular pyramids are made of a stack of successively reduced graphs embedded in the plane. Such pyramids are used within the segmentation framework to encode a hierarchy of pa...
Luc Brun, Walter G. Kropatsch
TCS
2010
13 years 8 months ago
Clustering with partial information
The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of disconnected cliq...
Hans L. Bodlaender, Michael R. Fellows, Pinar Hegg...