Name
Abstract | ||
|---|---|---|
•We study the Bicluster Graph Editing Problem and how it can be applied to solve the Manufacturing Cell Formation Problem.•We develop a Branch & Cut method for the Bicluster Graph Editing Problem that uses a dynamic programming separation module.•Our exact methods for the Manufacturing Cell Formation Problem are able to prove several previously unknown optima. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1016/j.ejor.2016.05.010 | European Journal of Operational Research |
Keywords | Field | DocType |
Combinatorial optimization,Biclusterization,Graph partitioning,Manufacturing cell formation | Convergence (routing),Graph,Mathematical optimization,Parameterized complexity,Vertex (geometry),Manufacturing cell,Computer science,Combinatorial optimization,Preprocessor,Graph partition | Journal |
Volume | Issue | ISSN |
254 | 3 | 0377-2217 |
Citations | PageRank | References |
5 | 0.48 | 10 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rian G. S. Pinheiro | 1 | 31 | 4.72 |
| Ivan C. Martins | 2 | 20 | 2.14 |
| Fábio Protti | 3 | 357 | 46.14 |
| Luiz S. Ochi | 4 | 160 | 12.54 |
| Luidi Simonetti | 5 | 152 | 15.82 |
| Anand Subramanian | 6 | 1154 | 58.21 |