Cut and flow formulations for the balanced connected k-partition problem (2020)
- Authors:
- Autor USP: WAKABAYASHI, YOSHIKO - IME
- Unidade: IME
- DOI: 10.1007/978-3-030-53262-8_11
- Assunto: PROGRAMAÇÃO LINEAR
- Keywords: connected partition; integer linear programming; facet; polyhedra; branch-and-cut
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título: Proceedings
- Conference titles: International Symposium on Combinatorial Optimization - ISCO
- Este periódico é de acesso aberto
- Este artigo NÃO é de acesso aberto
-
ABNT
MIYAZAWA, Flavio Keidi et al. Cut and flow formulations for the balanced connected k-partition problem. 2020, Anais.. Cham: Springer, 2020. Disponível em: https://doi.org/10.1007/978-3-030-53262-8_11. Acesso em: 26 jan. 2026. -
APA
Miyazawa, F. K., Moura, P. F. S., Ota, M. J., & Wakabayashi, Y. (2020). Cut and flow formulations for the balanced connected k-partition problem. In Proceedings. Cham: Springer. doi:10.1007/978-3-030-53262-8_11 -
NLM
Miyazawa FK, Moura PFS, Ota MJ, Wakabayashi Y. Cut and flow formulations for the balanced connected k-partition problem [Internet]. Proceedings. 2020 ;[citado 2026 jan. 26 ] Available from: https://doi.org/10.1007/978-3-030-53262-8_11 -
Vancouver
Miyazawa FK, Moura PFS, Ota MJ, Wakabayashi Y. Cut and flow formulations for the balanced connected k-partition problem [Internet]. Proceedings. 2020 ;[citado 2026 jan. 26 ] Available from: https://doi.org/10.1007/978-3-030-53262-8_11 - 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
- Polynomial-time approximation schemes for circle packing problems
- Selfish 2D bin packing game
- Packing entering sets in kernel systems
- Approximation algorithms for the orthogonal Z-oriented three-dimensional packing problem
- Some approximation results for the maximum agreement forest problem
- On the structure of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets
- The maximum agreement forest problem: approximation algorithms and computational experiments
- Approximation results on balanced connected partitions of graphs
Informações sobre o DOI: 10.1007/978-3-030-53262-8_11 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
3005308.pdf |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
