Some integer programs arising in the design of main frame computers (1993)
- Authors:
- Autor USP: FERREIRA, CARLOS EDUARDO - IME
- Unidade: IME
- DOI: 10.1007/bf01416008
- Subjects: PESQUISA OPERACIONAL; PROGRAMAÇÃO MATEMÁTICA
- Keywords: clustering problem; design of main frame computers; graph partitioning problem; hypergraph partitioning problem; integer programming; mathematical modelling; multiple knapsack problem
- Language: Inglês
- Source:
- Título: 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 acesso aberto
- Este artigo NÃO é de acesso aberto
-
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: 15 fev. 2026. -
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 2026 fev. 15 ] 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 2026 fev. 15 ] Available from: https://doi.org/10.1007/bf01416008 - The node capacitated graph partitioning problem: a computational study
- Algoritmos Branch e Bound para o problema de sequenciamento em uma única máquina
- Parallelisation of a multi-neighbourhood local search heuristic for a phylogeny problem
- Some formulations for the group Steiner tree problem
- Formulations and valid inequalities for the node capacitated graph partitioning problem
- Advances in bioinformatics and computational biology
- Discrete Applied Mathematics
- A new linear time algorithm to construct dominator trees of reducible flow graphs
- V Latin-American algorithms, graphs, and optimization symposium - Gramado, Brazil, 2009. [Editorial]
- Solving the maximum edge biclique packing problem on unbalanced bipartite graphs
Informações sobre o DOI: 10.1007/bf01416008 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
