A block coordinate descent enhanced metaheuristic for the Euclidean traveling salesman problem with polygonal neighborhoods (2025)
- Authors:
- USP affiliated authors: BIRGIN, ERNESTO JULIAN GOLDBERG - IME ; ERTEL, PAULA CRISTINA ROHR - IME
- Unidade: IME
- Subjects: HEURÍSTICA; LOGÍSTICA; OTIMIZAÇÃO COMBINATÓRIA
- Keywords: Métodos de busca em bloco de coordenadas; Traveling salesman problem; Problema do caixeiro viajante
- Language: Inglês
- Imprenta:
- Source:
- Título: Book of Abstracts of the EURO 2025
- Volume/Número/Paginação/Ano: 2025
- Conference titles: European Conference on Operational Research - EURO
-
ABNT
BIRGIN, Ernesto Julian Goldberg e ERTEL, Paula Cristina Rohr. A block coordinate descent enhanced metaheuristic for the Euclidean traveling salesman problem with polygonal neighborhoods. 2025, Anais.. Leeds: Instituto de Matemática e Estatística, Universidade de São Paulo, 2025. Disponível em: https://www.euro-online.org/media_site/reports/EURO34_AB.pdf. Acesso em: 04 jan. 2026. -
APA
Birgin, E. J. G., & Ertel, P. C. R. (2025). A block coordinate descent enhanced metaheuristic for the Euclidean traveling salesman problem with polygonal neighborhoods. In Book of Abstracts of the EURO 2025. Leeds: Instituto de Matemática e Estatística, Universidade de São Paulo. Recuperado de https://www.euro-online.org/media_site/reports/EURO34_AB.pdf -
NLM
Birgin EJG, Ertel PCR. A block coordinate descent enhanced metaheuristic for the Euclidean traveling salesman problem with polygonal neighborhoods [Internet]. Book of Abstracts of the EURO 2025. 2025 ;[citado 2026 jan. 04 ] Available from: https://www.euro-online.org/media_site/reports/EURO34_AB.pdf -
Vancouver
Birgin EJG, Ertel PCR. A block coordinate descent enhanced metaheuristic for the Euclidean traveling salesman problem with polygonal neighborhoods [Internet]. Book of Abstracts of the EURO 2025. 2025 ;[citado 2026 jan. 04 ] Available from: https://www.euro-online.org/media_site/reports/EURO34_AB.pdf - Um método heurístico para o problema do caixeiro viajante suficientemente próximo
- A heuristic method for the close enough traveling salesman problem
- Uma abordagem contínua para o problema do caixeiro viajante
- Optimization of slice configuration of steel coils
- Special issue on nonlinear programming dedicated to the ALIO-INFORMS Joint International Meeting 2010. [Prefácio]
- Low order-value approach for solving VaR-constrained optimization problems
- Large-scale active-set box-constrained optimization method with spectral projected gradients
- A box-constrained optimization algorithm with negative curvature directions and spectral projected gradients
- Spectral projected gradient methods: review and perspectives
- Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
3258192.pdf | Direct link |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
