Keyword: knapsack problem

Found 169 papers in total
An adapted step size algorithm for a 0–1 biknapsack Lagrangean dual
An adapted step size algorithm for a 0–1 biknapsack Lagrangean dual
2005,
This paper deals with a new algorithm for a 0–1 bidimensional knapsack...
Screening alternatives in multiple criteria subset selection
Screening alternatives in multiple criteria subset selection
2004,
New techniques are presented to reduce the number of feasible alternatives in certain...
Exact solution of a class of nonlinear knapsack problems
Exact solution of a class of nonlinear knapsack problems
2005,
We consider a class of nonlinear knapsack problems with applications in service...
On the complexity of the continuous unbounded knapsack problem with uncertain coefficients
On the complexity of the continuous unbounded knapsack problem with uncertain coefficients
2005,
In this paper, a linear-time algorithm is developed for the minmax-regret version of...
Construction of the facets of the polytope of the quadratic knapsack problem
Construction of the facets of the polytope of the quadratic knapsack problem
2003,
We build facets of the quadratic 0–1 knapsack polytope following two different...
The computation of the worst conditional expectation
The computation of the worst conditional expectation
2004,
Recent advances in risk theory identify risk as a measure related to the tail of a...
A cutting-plane generation method for a variable-capacity (0,1)-knapsack problem with general integer variables
A cutting-plane generation method for a variable-capacity (0,1)-knapsack problem with general integer variables
2004,
In this paper, we propose an effective cut generation method based on the...
An improved branch and bound algorithm for a strongly correlated unbounded knapsack problem
An improved branch and bound algorithm for a strongly correlated unbounded knapsack problem
2004,
An unbounded knapsack problem (KP) was investigated that describes the loading of...
Lifted inequalities for 0–1 mixed integer programming: Superlinear lifting
Lifted inequalities for 0–1 mixed integer programming: Superlinear lifting
2003,
We study the mixed 0–1 knapsack polytope, which is defined by a single knapsack...
On the facets of the mixed-integer knapsack polyhedron
On the facets of the mixed-integer knapsack polyhedron
2003,
We study the mixed-integer knapsack polyhedron, that is, the convex hull of the...
A scatter search method for the bi-criteria multi-dimensional {0,1}-knapsack problem using surrogate relaxation
A scatter search method for the bi-criteria multi-dimensional {0,1}-knapsack problem using surrogate relaxation
2004,
This paper presents a scatter search (SS) based method for the bi-criteria...
About fully polynomial approximability of the generalized knapsack problem
About fully polynomial approximability of the generalized knapsack problem
2003,
The generalized knapsack problem or gknap is the combinatorial optimization problem of...
Binary knapsack problems with random budgets
Binary knapsack problems with random budgets
2003,
The binary knapsack problem is a combinatorial optimization problem in which a subset...
Semidefinite relaxation of kanpsack problem
Semidefinite relaxation of kanpsack problem
2002,
Knapsack is a classical NP-hard problem. In the last ten years, semi-definite...
A recursive algorithm for the 0–1 knapsack problem
A recursive algorithm for the 0–1 knapsack problem
2002,
This paper analyzes the routine algorithm to solve the knapsack in the past, and puts...
Cyclic group and knapsack facets
Cyclic group and knapsack facets
2003,
Any integer program may be relaxed to a group problem. We define the master cyclic...
A polyhedral study of the cardinality constrained knapsack problem
A polyhedral study of the cardinality constrained knapsack problem
2003,
A cardinality constrained knapsack problem is a continuous knapsack problem in which...
The average behaviour of greedy algorithms for the knapsack problem: General distributions
The average behaviour of greedy algorithms for the knapsack problem: General distributions
2003,
The paper is a generalization of earlier work on the knapsack problem for arbitrary...
Hilbert bases and the facets of special knapsack polytopes
Hilbert bases and the facets of special knapsack polytopes
1996,
We present a linear description of the 0/1 knapsack polytope for the special case when...
Complete description of a class of knapsack polytopes
Complete description of a class of knapsack polytopes
2003,
We study the knapsack polytopes that arise whenever the item weights are of two types:...
Unbounded knapsack problem with controllable rates: The case of a random demand for items
Unbounded knapsack problem with controllable rates: The case of a random demand for items
2003,
This paper focuses on a dynamic, continuous-time control generalization of the...
Dynamic knapsack sets and capacitated lot-sizing
Dynamic knapsack sets and capacitated lot-sizing
2003,
A dynamic knapsack set is a natural generalization of the 0–1 knapsack set with...
Solving the 0/1 knapsack problem using an adaptive genetic algorithm
Solving the 0/1 knapsack problem using an adaptive genetic algorithm
2002,
Probabilistic and stochastic algorithms have been used to solve many hard optimization...
Facets of the complementarity knapsack polytope
Facets of the complementarity knapsack polytope
2002,
We present a polyhedral study of the complementarity knapsack problem. Traditionally,...
Papers per page: