Some integer programs arising in the design of main frame computers (1993)
- Autores:
- Autor USP: FERREIRA, CARLOS EDUARDO - IME
- Unidade: IME
- DOI: 10.1007/bf01416008
- Assuntos: PESQUISA OPERACIONAL; PROGRAMAÇÃO MATEMÁTICA
- Palavras-chave do autor: clustering problem; design of main frame computers; graph partitioning problem; hypergraph partitioning problem; integer programming; mathematical modelling; multiple knapsack problem
- Idioma: Inglês
- Fonte:
- Título do periódico: Mathematical Methods of Operations Research (Zeitschrift für Operations Research)
- ISSN: 0340-9422
- Volume/Número/Paginação/Ano: v. 38, n. 1, p. 77-100, 1993
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
ABNT
FERREIRA, Carlos Eduardo et al. Some integer programs arising in the design of main frame computers. Mathematical Methods of Operations Research (Zeitschrift für Operations Research), v. 38, n. 1, p. 77-100, 1993Tradução . . Disponível em: https://doi.org/10.1007/bf01416008. Acesso em: 19 set. 2024. -
APA
Ferreira, C. E., Grotschel, M., Martin, A., Weismantel, R., Kiefl, S., & Krispenz, L. (1993). Some integer programs arising in the design of main frame computers. Mathematical Methods of Operations Research (Zeitschrift für Operations Research), 38( 1), 77-100. doi:10.1007/bf01416008 -
NLM
Ferreira CE, Grotschel M, Martin A, Weismantel R, Kiefl S, Krispenz L. Some integer programs arising in the design of main frame computers [Internet]. Mathematical Methods of Operations Research (Zeitschrift für Operations Research). 1993 ; 38( 1): 77-100.[citado 2024 set. 19 ] Available from: https://doi.org/10.1007/bf01416008 -
Vancouver
Ferreira CE, Grotschel M, Martin A, Weismantel R, Kiefl S, Krispenz L. Some integer programs arising in the design of main frame computers [Internet]. Mathematical Methods of Operations Research (Zeitschrift für Operations Research). 1993 ; 38( 1): 77-100.[citado 2024 set. 19 ] Available from: https://doi.org/10.1007/bf01416008 - A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem
- A PTAS for the metric case of the optimum weighted source–destination communication spanning tree problem
- Some formulations for the group Steiner tree problem
- Decomposing matrices into blocks
- PTAS’s for some metric p-source communication spanning tree problems
- Syntenic global alignment and its application to the gene prediction problem
- The node capacitated graph pertitioning problem: a computational study
- The biclique k-clustering problem in bipartite graphs and its application in bioinformatics
- A dynamic programming algorithm for the tree mapping problem
- The node capacitated graph partitioning problem: a computational study
Informações sobre o DOI: 10.1007/bf01416008 (Fonte: oaDOI API)
Como citar
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
