Buscar
Mostrando ítems 161-170 de 377
Algoritmos de otimização para roteamento e agrupamento em redes de sensores sem fio com sorvedouros móveis
(Universidade Federal de Minas GeraisUFMG, 2009-07-17)
In this work, we introduce models and optimization algorithms to improve the Quality of Service in Wireless Sensor Networks with multiple mobile sinks. A discrete event simulator that integrates the proposed optimization ...
O problema biobjetivo da árvore geradora quadrática em adjacência de arestas
(Universidade Federal do Rio Grande do NorteBRUFRNPrograma de Pós-Graduação em Sistemas e ComputaçãoCiência da Computação, 2013-12-16)
The Quadratic Minimum Spanning Tree Problem (QMST) is a version of the Minimum
Spanning Tree Problem in which, besides the traditional linear costs, there is a quadratic
structure of costs. This quadratic structure models ...
A polynomial-time branching procedure for the multiprocessor scheduling problem
(BrasilInstituto Tércio Pacitti de Aplicações e Pesquisas Computacionais, 2017)
Simulação e técnicas da computação evolucionária aplicadas a problemas de programação linear inteira mista
(Centro Federal de Educação Tecnológica do ParanáCuritibaPrograma de Pós-Graduação em Engenharia Elétrica e Informática Industrial, 2005)
Presently, companies live a reality of rapid economic transformations generated by globalization. The growth of the products and services international trade, the constant exchange of information and the cultural interchange ...
Otimização linear aplicada ao balanceamento de estoque de uma indústria de móveis
(Universidade Tecnológica Federal do ParanáCornelio ProcopioBrasilLicenciatura em MatemáticaUTFPR, 2018)
This work presents a study on Linear Optimization and its application in the stocks balancing production planning and control of a furniture industry. The Mathematical modeling of the studied problem is performed using the ...
Problemes d'optimisatión globale en statistique robuste
(2011)
Robust statistics is a branch of statistics dealing with the analysis of data containing contarninated observations. The robustness of an estirnator is rnea.sured notably by means of the br-eakrlown po'int. High-breakdown ...
An corrigendum on the paper: Solving the job-shop scheduling problem optimally by dynamic programming
(Pergamon-Elsevier Science Ltd, 2017-02)
In [1] an algorithm is proposed for solving the job-shop scheduling problem optimally using a dynamic programming strategy. This is, according to our knowledge, the first exact algorithm for the Job Shop problem which is ...