A randomized approximation algorithm for the weighted fractional cut-covering problem (2023)
- Authors:
- Autor USP: SILVA, MARCEL KENJI DE CARLI - IME
- Unidade: IME
- Subjects: PROGRAMAÇÃO LINEAR; EMPACOTAMENTO E COBERTURA; ALGORITMOS DE APROXIMAÇÃO
- Language: Português
- Imprenta:
- Publisher: SIAM
- Publisher place: Philadelphia
- Date published: 2023
- Source:
- Título do periódico: Abstracts
- Conference titles: Conference on Optimization - OP23
-
ABNT
PROENÇA, Nathan Benedetto et al. A randomized approximation algorithm for the weighted fractional cut-covering problem. 2023, Anais.. Philadelphia: SIAM, 2023. Disponível em: https://www.siam.org/Portals/0/Conferences/OP/OP23_ABSTRACTS.pdf. Acesso em: 28 abr. 2024. -
APA
Proença, N. B., Silva, M. K. de C., Sato, C. M., & Tunçel, L. (2023). A randomized approximation algorithm for the weighted fractional cut-covering problem. In Abstracts. Philadelphia: SIAM. Recuperado de https://www.siam.org/Portals/0/Conferences/OP/OP23_ABSTRACTS.pdf -
NLM
Proença NB, Silva MK de C, Sato CM, Tunçel L. A randomized approximation algorithm for the weighted fractional cut-covering problem [Internet]. Abstracts. 2023 ;[citado 2024 abr. 28 ] Available from: https://www.siam.org/Portals/0/Conferences/OP/OP23_ABSTRACTS.pdf -
Vancouver
Proença NB, Silva MK de C, Sato CM, Tunçel L. A randomized approximation algorithm for the weighted fractional cut-covering problem [Internet]. Abstracts. 2023 ;[citado 2024 abr. 28 ] Available from: https://www.siam.org/Portals/0/Conferences/OP/OP23_ABSTRACTS.pdf - Relações min-max em otimização combinatória
- An axiomatic duality framework for the theta body and related convex corners
- Sparse sums of positive semidefinite matrices
- A notion of total dual integrality for convex, semidefinite, and extended formulations
- An axiomatic duality framework for the theta body and related convex corners
- Vertices of spectrahedra arising from the elliptope, the theta body, and their relatives
- Commute time as a method to explore brain functional connectomes
- Strict complementarity in semidefinite optimization with elliptopes including the maxCut SDP
- Algebras, graphs and thetas
- Dual Hoffman bounds for the stability and chromatic numbers based on semidefinite programming
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 | 3180338.pdf |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
