Results 1  10
of
30
The zero/one multiple knapsack problem and genetic algorithms
 Proceedings of the 1994 ACM Symposium on Applied Computing
, 1994
"... A genetic algorithm, GENEsYs, is applied to an NPcomplete problem, the 0/1 multiple knapsack problem. The partitioning of the search space resulting from this highly constrained problem may include substantially large infeasible regions. Our implementation allows for the breeding and participatio ..."
Abstract

Cited by 81 (1 self)
 Add to MetaCart
A genetic algorithm, GENEsYs, is applied to an NPcomplete problem, the 0/1 multiple knapsack problem. The partitioning of the search space resulting from this highly constrained problem may include substantially large infeasible regions. Our implementation allows for the breeding
Knapsack: A ZeroCycle Memory Hierarchy Component
, 1993
"... The widening gap between processors and memory necessitates the development of novel memory hierarchies: hierarchies that can possibly service memory references at register speeds, since service at cache speeds may not be adequate. We consider the design of a novel memory hierarchy component, a knap ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
knapsack, whose purpose is to provide (very) fast access to frequentlyused data objects. Software allocates frequentlyused objects into a knapsack region of the address space; a knapsack provides fast access (at register speeds in many cases) to these objects. We discuss how a knapsack is different from
Genetic Algorithm solution for Cryptanalysis of Knapsack Cipher with Knapsack Sequence of Size 16
"... With growth of networked systems and applications such as ecommerce, the demand for internet security is increasing. Information can be secured using cryptography, antivirus, malwares, spywares, firewall etc. In cryptology, cryptanalysis is a discipline where the ciphers are attacked and broke thu ..."
Abstract
 Add to MetaCart
, researchers have attacked the knapsack cipher with a knapsack sequence of size 8. This supports the ASCII representation of the characters. The ASCII representation supports the regional languages like English, numerals and symbols. In this paper we propose the attack on knapsack cipher with knapsack sequence
Statistical mechanics of the multiconstraint continuous knapsack problem
, 1997
"... We apply the replica analysis established by Gardner to the multiconstraint continuous knapsack problem, which is one of the linear programming problems and a most fundamental problem in the field of operations research (OR). For a large problem size, we analyse the space of solution and its volum ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We apply the replica analysis established by Gardner to the multiconstraint continuous knapsack problem, which is one of the linear programming problems and a most fundamental problem in the field of operations research (OR). For a large problem size, we analyse the space of solution and its
MOEA/D with Uniform Design for Solving Multiobjective Knapsack Problems
"... Abstract—The 0/1 knapsack problem is a wellknown problem, which appears in many real domains with practical importance. The problem is NPcomplete. The multiobjective 0/1 knapsack problem is a generalization of the 0/1 knapsack problem in which multiple knapsacks are considered. Many algorithms ha ..."
Abstract
 Add to MetaCart
coefficient vectors so that the decomposed scalar optimization subproblems are uniformly scattered, and therefore the algorithm could explore uniformly the region of interest from the initial iteration. To illustrate how the algorithm works, some numerical experiments on the benchmark multiobjective knapsack
A Local Search Based Heuristic for the Demand Constrained Multidimensional Knapsack Problem
, 2001
"... We consider an extension of the 01 multidimensional knapsack problem in which there are greaterthanequal inequalities, called demand constraints, besides the standard lessthanequal constraints. Moreover the objective function coefficients are not constrained in sign. This problem is worth consi ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We consider an extension of the 01 multidimensional knapsack problem in which there are greaterthanequal inequalities, called demand constraints, besides the standard lessthanequal constraints. Moreover the objective function coefficients are not constrained in sign. This problem is worth
A LocalSearchBased Heuristic for the DemandConstrained Multidimensional Knapsack Problem
"... informs ® doi 10.1287/ijoc.1030.0050 © 2005 INFORMS We consider an extension of the 0–1 multidimensional knapsack problem in which there are greaterthanorequalto inequalities, called demand constraints, in addition to the standard lessthanorequalto constraints. Moreover, the objective functio ..."
Abstract
 Add to MetaCart
informs ® doi 10.1287/ijoc.1030.0050 © 2005 INFORMS We consider an extension of the 0–1 multidimensional knapsack problem in which there are greaterthanorequalto inequalities, called demand constraints, in addition to the standard lessthanorequalto constraints. Moreover, the objective
An Evolutionary Path Relinking Approach for the Quadratic Multiple Knapsack Problem
, 2015
"... The quadratic multiple knapsack problem (QMKP) is a challenging combinatorial optimization problem with numerous applications. In this paper, we propose the first evolutionary path relinking approach (EPR) for solving the QMKP approximately. This approach combines advanced features both from the pat ..."
Abstract
 Add to MetaCart
The quadratic multiple knapsack problem (QMKP) is a challenging combinatorial optimization problem with numerous applications. In this paper, we propose the first evolutionary path relinking approach (EPR) for solving the QMKP approximately. This approach combines advanced features both from
Integrating partial optimization with scatter search for solving bicriteria {0,1}knapsack problems
, 2004
"... This paper deals with the problem of inaccuracy of the solutions generated by metaheuristic approaches for bicriteria {0,1}knapsack problems. A hybrid approach which combines systematic and heuristic search is proposed to reduce that inaccuracy in the context of a scatter search method. The compon ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
This paper deals with the problem of inaccuracy of the solutions generated by metaheuristic approaches for bicriteria {0,1}knapsack problems. A hybrid approach which combines systematic and heuristic search is proposed to reduce that inaccuracy in the context of a scatter search method
An exact method for the bicriteria {0,1}knapsack problem based on functions specialization
, 2004
"... This paper presents a new exact method for the bicriteria {0,1}knapsack problem by using a family of weighted sum functions. These functions are used independently to obtain subsets of e¢cient solutions with similar structure and to build convex regions (bands) in the criteria space. These regions ..."
Abstract
 Add to MetaCart
This paper presents a new exact method for the bicriteria {0,1}knapsack problem by using a family of weighted sum functions. These functions are used independently to obtain subsets of e¢cient solutions with similar structure and to build convex regions (bands) in the criteria space
Results 1  10
of
30