A branch-and-bound algortihm for the cell formation problem
Year of publication: |
1-15 May 2018
|
---|---|
Authors: | Utkina, Irina E. ; Batsyn, Mikhail ; Batsyna, Ekaterina K. |
Published in: |
International journal of production research. - London : Taylor & Francis, ISSN 0020-7543, ZDB-ID 160477-6. - Vol. 56.2018, 9 (1/15.5.), p. 3262-3273
|
Subject: | cell formation problem | biclustering | branch-and-bound | Dinkelbach approach | exact solution | Fertigungsinsel | Cellular manufacturing | Mathematische Optimierung | Mathematical programming | Operations Research | Operations research | Branch-and-Bound | Branch and Bound | USA | United States | Theorie | Theory |
-
A general branch-and-bound algorithm for fair division problems
Vetschera, Rudolf, (2010)
-
A branch-and-bound approach for maximum quasi-cliques
Mahdavi Pajouh, Foad, (2014)
-
A branch-and-bound algorithm for the quadratic multiple knapsack problem
Fleszar, Krzysztof, (2022)
- More ...
-
Vehicle assignment in site-dependent vehicle routing problems with split deliveries
Batsyn, Mikhail, (2021)
-
NP-completeness of cell formation problem with grouping efficacy objective
Batsyn, Mikhail, (2020)
-
Infra-chromatic bound for exact maximum clique search
San Segundo, Pablo, (2014)
- More ...