Buscar
Mostrando ítems 111-120 de 377
Exact Algorithms for the Graph Coloring Problem
(Instituto de Informática - Universidade Federal do Rio Grande do Sul, 2018)
Um estudo algorítmico para a otimização de compra em grupo com múltiplos fornecedores e descontos em escala
(Universidade Federal do Rio Grande do NorteBrasilUFRNCiência da Computação, 2016-06)
This work studies the optimization in the distribution of buyers in a group of suppliers, taking into consideration the necessities and preferences based on the product’s characteristics, group discounts available by the ...
Incorporating condition measures in the context of combinatorial optimization
(SIAM PUBLICATIONS, 2006)
Integer programming algorithms have some kind of exponential complexity in the worst case. However, it is also observed that data instances of similar sizes might have very different practical complexity when solved by ...
Exact solutions of rectangular partitions via integer programming
(World Scientific Publ Co Pte LtdSingaporeSingapura, 2000)
A branch-and-cluster coordination scheme for selecting prison facility sites under uncertainty
(PERGAMON-ELSEVIER, 2012-09)
A multi-period stochastic model and an algorithmic approach to location of prison facilities under uncertainty are presented and applied to the Chilean prison system. The problem consists of finding locations and sizes of ...
A branch-and-cluster coordination scheme for selecting prison facility sites under uncertainty
(PERGAMON-ELSEVIER SCIENCE LTD, 2012)
A multi-period stochastic model and an algorithmic approach to location of prison facilities under uncertainty are presented and applied to the Chilean prison system. The problem consists of finding locations and sizes of ...
Resolución de un problema de selección de áreas óptimas para forestación, representado como un "Knapsack Problem", mediante la aplicación de un algoritmo genético y técnicas de topología
(2018)
Policy initiatives and decision makers dealing with environmental conservation are interested in forestation projects in order to minimize runoff sediment reaching riverbeds. Selecting the optimal areas in which to plant ...
Planejamento de reativos em sistemas de energia elétrica através de um algoritmo de Branch-and-Bound não linear
(Universidade Estadual Paulista (UNESP), 2014)
Modelos e algoritmos para problemas integrados de distribuição e roteamento (Models and algorithms for the integrated routing and distribution problems)
(Universidade Federal de Minas GeraisUFMG, 2012-12-14)
Since the Vehicle Routing Problem (VRP) was introduced by Dantzig and Ramser, it became one of the most studied problems in Combinatorial Optimization. Different solution approaches were proposed over the past decades to ...