Buscar
Mostrando ítems 1-10 de 695
Reconstructing 3-colored grids from horizontal and vertical projections is NP-Hard: a solution to the 2-Atom problem in discrete tomography
(SIAM PUBLICATIONS, 2012)
We consider the problem of coloring a grid using k colors with the restriction that each row and each column has a specific number of cells of each color. This problem has been known as the (k - 1)-atom problem in the ...
The open capacitated arc routing problem
(2009-01-01)
An exploration of simulated annealing and its implementations to solve NP-hard problems
(Universidad de los AndesIngeniería de Sistemas y ComputaciónFacultad de IngenieríaDepartamento de Ingeniería de Sistemas y Computación, 2021)
Simulación de algoritmos aproximados para solucionar rápido problemas NP
Engineering Design under Imprecise Probabilities: Computational Complexity
(Universidad de La Frontera. Departamento de Matemática y EstadísticaUniversidade Federal de Pernambuco. Departamento de Matemática, 2011)
Biogeography-Based Optimization Algorithm for solving the set covering problem
(Springer Verlag, 2016)
Set covering problem solved by new binary firefly algorithm [Problema de Cobertura de Conjunto Resuelto por el Nuevo Algoritmo Luciérnaga Binario]
(Institute of Electrical and Electronics Engineers Inc., 2015)
Problem of assignment cells to switches in a cellular mobile network via beam search method
(2010-01-01)
The problem of assigning cells to switches in a cellular mobile network is an NP-hard optimization problem. So, real size mobile networks could not be solved by using exact methods. The alternative is the use of the heuristic ...
Problem of assignment cells to switches in a cellular mobile network via beam search method
(2010-01-01)
The problem of assigning cells to switches in a cellular mobile network is an NP-hard optimization problem. So, real size mobile networks could not be solved by using exact methods. The alternative is the use of the heuristic ...