Keyword: knapsack problem

Found 169 papers in total
A dynamic programming approach for consistency and propagation for knapsack constraints
A dynamic programming approach for consistency and propagation for knapsack constraints
2003,
Knapsack constraints are a key modeling structure in constraint programming. These...
Semi-definite relaxation algorithm for the multiple knapsack problem
Semi-definite relaxation algorithm for the multiple knapsack problem
2002,
The multiple knapsack problem denoted by MKP(B,S,m,n) can be defined as follows. A set...
An approximate dynamic programming approach to multidimensional knapsack problems
An approximate dynamic programming approach to multidimensional knapsack problems
2002,
We present an Approximate Dynamic Programming (ADP) approach for the multidimensional...
Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions
Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions
2002,
We use surrogate analysis and constraint pairing in multidimensional knapsack problems...
A new procedure for the calculation of the compartmented knapsack problem
A new procedure for the calculation of the compartmented knapsack problem
2002,
It considers the classic knapsack problem. It admits that items must be grouped in...
Approximating multiobjective knapsack problems
Approximating multiobjective knapsack problems
2002,
For multiobjective optimization problems, it is meaningful to compute a set of...
Polynomial time approximation schemes for class-constrained packing problems
Polynomial time approximation schemes for class-constrained packing problems
2001,
We consider variants of the classic bin packing and multiple knapsack problems, in...
A new artificial neural network approach to solving knapsack problems
A new artificial neural network approach to solving knapsack problems
2001,
The knapsack problem is a classical combinatorial optimization problem which plays an...
Approximation algorithms for fractional knapsack problems
Approximation algorithms for fractional knapsack problems
2002,
We consider the combinatorial optimization problem where the objective function is the...
Cost based filtering for the constrained knapsack problem
Cost based filtering for the constrained knapsack problem
2002,
We present cost based filtering methods for Knapsack Problems (KPs). Cost based...
A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems
A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems
2002,
We present an exact separation scheme for identifying most violated extended cover...
On characterizing maximal covers
On characterizing maximal covers
2002,
In this paper we introduce the concept of maximal covers and provide some...
The maximum linear programming knapsack problem with extended generalized upper bound constraints
The maximum linear programming knapsack problem with extended generalized upper bound constraints
2001,
In this paper, we consider a maximin version of the linear programming knapsack...
On two class-constrained versions of the multiple knapsack problem
On two class-constrained versions of the multiple knapsack problem
2001,
We study two variants of the classic knapsack problem, in which we need to place items...
On two class-constrained versions of the multiple knapsack problem
On two class-constrained versions of the multiple knapsack problem
2001,
We study two variants of the classic knapsack problem, in which we need to place items...
Interactive knapsacks
Interactive knapsacks
2000,
The interactive knapsack problems are generalizations of the classical knapsack...
A new algorithm for solving the partition problem
A new algorithm for solving the partition problem
2000,
The partition problem is fundamental to many VLSI-CAD applications. This paper is...
On using an automatic scheme for obtaining the convex hull defining inequalities of a Weismantel 0–1 knapsack constraint
On using an automatic scheme for obtaining the convex hull defining inequalities of a Weismantel 0–1 knapsack constraint
1999,
In this short note we obtain the full set of inequalities that define the convex hull...
On surrogating 0–1 knapsack constraints
On surrogating 0–1 knapsack constraints
1999,
In this note, we present a scheme for tightening 0–1 knapsack constraints based...
The tree center problems and the relationship with the bottleneck knapsack problems
The tree center problems and the relationship with the bottleneck knapsack problems
1997,
The tree center problems are designed to find a subtree minimizing the maximum...
Line-up competition algorithm solving combinatorial optimization problems
Line-up competition algorithm solving combinatorial optimization problems
2000,
The framework is given for solving combinatorial optimization problems with line-up...
A cut generation method for the (0,1)-knapsack problem with a variable capacity
A cut generation method for the (0,1)-knapsack problem with a variable capacity
2000,
In this paper, we propose a practical cut generation method based on the...
Bilevel programming with knapsack constraints
Bilevel programming with knapsack constraints
2000,
A special class of bilevel programming problems with discrete parametric lower level...
Heuristic and exact algorithms for the precedence-constrained knapsack problem
Heuristic and exact algorithms for the precedence-constrained knapsack problem
2000,
The knapsack problem (KP) is generalized taking into account a precedence relation...
Papers per page: