A systematic approach to bound factor-revealing LPs and its application to the metric and squared metric facility location problems (2015)
- Authors:
- Autor USP: FERNANDES, CRISTINA GOMES - IME
- Unidade: IME
- DOI: 10.1007/s10107-014-0821-x
- Subjects: OTIMIZAÇÃO COMBINATÓRIA; PROGRAMAÇÃO LINEAR
- Language: Inglês
- Imprenta:
- Publisher place: Heidelberg
- Date published: 2015
- Source:
- Título: Mathematical Programming
- ISSN: 1436-4646
- Volume/Número/Paginação/Ano: v. 153, n. 2, p.655-685, Nov. 2015
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
ABNT
FERNANDES, Cristina Gomes et al. A systematic approach to bound factor-revealing LPs and its application to the metric and squared metric facility location problems. Mathematical Programming, v. No 2015, n. 2, p. 655-685, 2015Tradução . . Disponível em: https://doi.org/10.1007/s10107-014-0821-x. Acesso em: 06 nov. 2024. -
APA
Fernandes, C. G., Meira, L. A. A., Miyazawa, F. K., & Pedrosa, L. L. C. (2015). A systematic approach to bound factor-revealing LPs and its application to the metric and squared metric facility location problems. Mathematical Programming, No 2015( 2), 655-685. doi:10.1007/s10107-014-0821-x -
NLM
Fernandes CG, Meira LAA, Miyazawa FK, Pedrosa LLC. A systematic approach to bound factor-revealing LPs and its application to the metric and squared metric facility location problems [Internet]. Mathematical Programming. 2015 ; No 2015( 2): 655-685.[citado 2024 nov. 06 ] Available from: https://doi.org/10.1007/s10107-014-0821-x -
Vancouver
Fernandes CG, Meira LAA, Miyazawa FK, Pedrosa LLC. A systematic approach to bound factor-revealing LPs and its application to the metric and squared metric facility location problems [Internet]. Mathematical Programming. 2015 ; No 2015( 2): 655-685.[citado 2024 nov. 06 ] Available from: https://doi.org/10.1007/s10107-014-0821-x - Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width
- Kinetic clustering of points on the line
- Multicuts in unweighted digraphs with bounded degree and bounded tree-width
- Independent dominating sets in planar triangulations
- On Tuza’s conjecture for triangulations and graphs with small treewidth
- On edge-magic labelings of forests
- Problemas circulatorios em grafos
- A better approximation ratio for the minimum k-edge-connected spanning subgraph problem
- A new approximation algorithm for finding heavy planar subgraphs
- Approximation algorithms for the max-buying problem with limited supply
Informações sobre o DOI: 10.1007/s10107-014-0821-x (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
