Buscar
Mostrando ítems 21-30 de 1336
A single vehicle routing problem with fixed delivery and optional collections
(TAYLOR & FRANCIS INC, 2009)
The Single-Vehicle Routing Problem with Fixed Delivery and Optional Collections considers a set of delivery customers receiving goods from a depot and a set of collection customers sending goods to the same depot. All ...
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 ...
Minmax regret combinatorial optimization problems: an Algorithmic Perspective
(CAMBRIDGE UNIV PRESS, 2012)
A hybrid method for the probabilistic maximal covering location-allocation problem
(Elsevier B.V., 2015-05-01)
This paper presents a hybrid algorithm that combines a metaheuristic and an exact method to solve the Probabilistic Maximal Covering Location-Allocation Problem. A linear programming formulation for the problem presents ...
Dynamic properties of an exact algorithm for square root calculation
(ELSEVIER, 2006-11-15)
The digits of the square root of any real number can be consecutively calculated by hand with the use of a very popular exact algorithm. We show that the application of that algorithm defines a dynamic system in the sense ...
Iterative Compression and Exact Algorithms
(2010)
Iterative Compression has recently led to a number of breakthroughs
in parameterized complexity. Here, we show that the technique can
also be useful in the design of exact exponential time algorithms to
solve NP-hard ...
An algorithm for the strip packing problem using collision free region and exact fitting placement
(ELSEVIER SCI LTDOXFORD, 2012-08)
The irregular shape packing problem is approached. The container has a fixed width and an open dimension to be minimized. The proposed algorithm constructively creates the solution using an ordered list of items and a ...