Partitioning a graph into balanced connected classes: Formulations, separation and experiments (2021)
- Authors:
- Autor USP: WAKABAYASHI, YOSHIKO - IME
- Unidade: IME
- DOI: 10.1016/j.ejor.2020.12.059
- Assunto: TEORIA DOS GRAFOS
- Keywords: Integer programming; Branch-and-cut; Separation algorithm; Balanced partition; Connected partition
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título: European Journal of Operational Research
- ISSN: 0377-2217
- Volume/Número/Paginação/Ano: v. 293, n. 3, p. 826-836, 2021
- Este periódico é de acesso aberto
- Este artigo NÃO é de acesso aberto
-
ABNT
MIYAZAWA, Flavio Keidi et al. Partitioning a graph into balanced connected classes: Formulations, separation and experiments. European Journal of Operational Research, v. 293, n. 3, p. 826-836, 2021Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2020.12.059. Acesso em: 09 fev. 2026. -
APA
Miyazawa, F. K., Moura, P. F. S., Ota, M. J., & Wakabayashi, Y. (2021). Partitioning a graph into balanced connected classes: Formulations, separation and experiments. European Journal of Operational Research, 293( 3), 826-836. doi:10.1016/j.ejor.2020.12.059 -
NLM
Miyazawa FK, Moura PFS, Ota MJ, Wakabayashi Y. Partitioning a graph into balanced connected classes: Formulations, separation and experiments [Internet]. European Journal of Operational Research. 2021 ; 293( 3): 826-836.[citado 2026 fev. 09 ] Available from: https://doi.org/10.1016/j.ejor.2020.12.059 -
Vancouver
Miyazawa FK, Moura PFS, Ota MJ, Wakabayashi Y. Partitioning a graph into balanced connected classes: Formulations, separation and experiments [Internet]. European Journal of Operational Research. 2021 ; 293( 3): 826-836.[citado 2026 fev. 09 ] Available from: https://doi.org/10.1016/j.ejor.2020.12.059 - Packing in generalized kernel systems: a framework that generalizes packing of branchings
- Contribuições a teoria dos grafos e otimização combinatória
- Two-and three-dimensional parametric packing
- Tree 3-spanners on generalized prisms of graphs
- Quebra-cabecas e plano-decorte
- Approximation and parameterized algorithms for balanced connected partition problems
- Cube packing
- Two- and three-dimensional parametric packing
- On the structure of the monotone asymmetric travelling salesman polytope II: hypotraceable facets
- Polyhedral and computational results on the k-hop connected dominating set problem
Informações sobre o DOI: 10.1016/j.ejor.2020.12.059 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
3015999.pdf | ||
 |
3015999.pdf | Direct link |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
