Knapsack problem
Top PDF Knapsack problem:
Multiobjective knapsack problem using NSGA II algorithm
... (Knapsack problem) bajo el esquema mono-objetivo tiene como fin determinar cuáles elementos deben ser adicionados en una mochila con el propósito de obtener el máximo beneficio nutricional pero garantizando ...
6
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
... Los problemas del tipo NP-fuertes y NP-completos est´an relacionados directamente con la complejidad algor´ıtmica requerida para su soluci´on. Existen problemas que pueden ser resueltos utilizando un algoritmo que se ...
83
The ant colony metaphor for multiple knapsack problem
... This paper presents an Ant Colony (AC) model for the Multiple Knapsack Problem (MKP). The ant colony metaphor, as well as other evolutionary metaphors, was applied successfully to diverse heavily ...
11
Parallel ant system applied to the multiple knapsack problem
... There exist several types of computer platforms suitable for implementing parallel applica- tions. Our work aims to exploit the capability of a distributed computing environment by using PVM package (Parallel Virtual ...
11
The ant colony metaphor for multiple knapsack problem
... Multiple Knapsack Problem and Zero/One Knapsack Problem have been intensively studied using different traditional methods, such as Branch-and-Bound and Dynamic Programming ...
11
Stochastic Set PStochastic Set Packing Problemacking Problem
... In this paper a stochastic version of the Set Packing Problem, SPP, is studied via scenario analysis. We consider a one-stage recourse approach to deal with the uncertainty in the coefficients. This consists of ...
29
Intelligent systems engineering with reconfigurable computing
... the knapsack problem for our experiments because: 1) it represents a very large number of real-world problems; and 2) it provides very good teaching ...the knapsack problem to be a good ...
10
The unsplittable stable marriage problem
... Gale and Shapley [3] devised a simple intuitive algorithm, now quite well known, for solving the classical “one-to-one” stable marriage problem. The algorithm is usually described in terms of men being assigned to ...
11
Beyond the classical Stefan problem
... Stefan problem requires solving heat equations for the solid and liquid phases subject to a condition in the solid-liquid interface describing the evolution of the phase change ...the problem by assuming ...
182
Problem Understanding through Landscape Theory
... a problem and both have been criticized in the ...optimization problem has a one-to-one relationship with the expectation curves (depending on the probability of mutation) of ...
8
El estudio de problemas agronómicos a nivel de campo
... problem a y la factibilidad de su solución. En las tablas que siguen se presenta una propuesta para decidir acerca de la factibilidad de resolver un problem a en función de sus propias circunstancias o de ...
24
On Problem-Oriented Kernel Refining
... a problem, no de!nite solution for this taskhas been found yet, since choosing the best kernel very often reduces to a selection among di;erent possibilities by a cross-validation ...every problem at hand, ...
16
Algorithm creation and optimization for the crew pairing problem
... Pairing Problem) para que produzca un coste mínimo por tripulante y en el que considera de igual forma a tripulantes técnicos y tripulantes de cabina por influir de igual manera en el problema, aunque se centra en ...
44
Algoritmo metaheurístico paralelo usando CUDA para solucionar problemas 0/1 knapsack basado en el procedimiento de búsqueda del pescador
... 0/1 Knapsack y sus resultados numéricos demostraron que este algoritmo es más efectivo para resolver problemas de programación ...0/1 Knapsack con programación ...
115
Capacitated fixed cost facility location problem with transportation choices
... objective problems to multiobjective problems with an increasing interest in the academic community. The metaheuristic algorithm designed in this study uses some ideas of the approach proposed by González Velarde and ...
133
OPPOSITE LEARNING STRATEGIES FOR IMPROVING THE SEARCH PROCESS OF ANT-BASED ALGORITHMS
... Ant Knapsack and Focused Ant Solver show how each method allows the original algorithms to change their intermediate decisions and also, in some cases, reach better quality ...Ant Knapsack, but it worsens ...
161
Una generalización de las desigualdades de knapsack cover
... las knapsack-cover inequalities para el caso de funciones de costos lineales por partes, mostramos que su relajaci´on y un algoritmo primal-dual mantienen el gap de integralidad en ...Flow-cover Problem on ...
89
The Coupon Collector's Problem.
... following problem: how many coupons we have to purchase (on average) to complete a ...This problem, which takes every- body back to his childhood when this was really “a prob- lem”, has been considered by ...
35