Two simplified versions of Red-Blue Facility Location (2019)
- Authors:
- USP affiliated authors: FERNANDES, CRISTINA GOMES - IME ; POCAI, RAFAEL VEIGA - IME
- Unidade: IME
- Assunto: OTIMIZAÇÃO COMBINATÓRIA
- Language: Português
- Imprenta:
- Publisher: SBC
- Publisher place: Porto Alegre
- Date published: 2019
- Source:
- Título do periódico: Anais
- Conference titles: Congresso da Sociedade Brasileira de Computação - CSBC
-
ABNT
FERNANDES, Cristina Gomes e POCAI, Rafael Veiga. Two simplified versions of Red-Blue Facility Location. 2019, Anais.. Porto Alegre: SBC, 2019. Disponível em: https://sol.sbc.org.br/index.php/etc/article/view/6391/6287. Acesso em: 30 abr. 2024. -
APA
Fernandes, C. G., & Pocai, R. V. (2019). Two simplified versions of Red-Blue Facility Location. In Anais. Porto Alegre: SBC. Recuperado de https://sol.sbc.org.br/index.php/etc/article/view/6391/6287 -
NLM
Fernandes CG, Pocai RV. Two simplified versions of Red-Blue Facility Location [Internet]. Anais. 2019 ;[citado 2024 abr. 30 ] Available from: https://sol.sbc.org.br/index.php/etc/article/view/6391/6287 -
Vancouver
Fernandes CG, Pocai RV. Two simplified versions of Red-Blue Facility Location [Internet]. Anais. 2019 ;[citado 2024 abr. 30 ] Available from: https://sol.sbc.org.br/index.php/etc/article/view/6391/6287 - Problemas computacionais em teoria topológica dos grafos
- Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width
- Kinetic clustering of points on the line
- Independent dominating sets in planar triangulations
- On Tuza’s conjecture for triangulations and graphs with small treewidth
- Multicuts in unweighted digraphs with bounded degree and bounded tree-width
- On edge-magic labelings of forests
- Reaction motifs in metabolic networks
- Maximum series-parallel subgraph
- A systematic approach to bound factor revealing LPs and its application to the metric and squared metric facility location problems
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 | 2960711.pdf | Direct link |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
