Keyword: knapsack problem

Found 169 papers in total
An ant colony optimization approach for the multidimensional knapsack problem
An ant colony optimization approach for the multidimensional knapsack problem
2010,
Ant colony optimization is a metaheuristic that has been applied to a variety of...
Scheduling parallel dedicated machines with the speeding-up resource
Scheduling parallel dedicated machines with the speeding-up resource
2008,
We consider a problem of scheduling jobs on m parallel machines. The machines are...
An exact algorithm for the knapsack problem with setup
An exact algorithm for the knapsack problem with setup
2009,
In this paper we studies a 0-1 Knapsack Problem with Setup (KPS). One set of 0-1...
Solution of large quadratic knapsack problems through aggressive reduction
Solution of large quadratic knapsack problems through aggressive reduction
2007,
The quadratic knapsack problem (QKP) calls for maximizing a quadratic objective...
An improved partial enumeration algorithm for integer programming problems
An improved partial enumeration algorithm for integer programming problems
2009,
In this paper, we present an improved Partial Enumeration Algorithm for Integer...
Convergent Lagrangian and domain cut method for nonlinear knapsack problems
Convergent Lagrangian and domain cut method for nonlinear knapsack problems
2009,
The nonlinear knapsack problem, which has been widely studied in the OR literature, is...
Experiments concerning sequential versus simultaneous maximization of objective function and distance
Experiments concerning sequential versus simultaneous maximization of objective function and distance
2008,
Suppose two solution vectors are needed that have good objective function values and...
Higher-order cover cuts from zero–one knapsack constraints augmented by two-sided bounding inequalities
Higher-order cover cuts from zero–one knapsack constraints augmented by two-sided bounding inequalities
2008,
Extending our work on second-order cover cuts, we introduce a new class of...
Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes
Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes
2008,
Cover inequalities are commonly used cutting planes for the 0–1 knapsack...
Bilevel programming with knapsack constraints
Bilevel programming with knapsack constraints
2000,
A special class of bilevel programming problems with discrete parametric lower level...
Allocating procurement to capacitated suppliers with concave quantity discounts
Allocating procurement to capacitated suppliers with concave quantity discounts
2008,
We consider a procurement problem where suppliers offer concave quantity discounts....
Sensitivity analysis of the knapsack sharing problem: perturbation of the profit of an item
Sensitivity analysis of the knapsack sharing problem: perturbation of the profit of an item
2008,
In this paper, we study the sensitivity of the optimum of a max–min...
On separating cover inequalities for the multidimensional knapsack problem
On separating cover inequalities for the multidimensional knapsack problem
2007,
We propose a simple and a quite efficient separation procedure to identify cover...
On a nonseparable convex maximization problem with continuous knapsack constraints
On a nonseparable convex maximization problem with continuous knapsack constraints
2007,
We develop a polynomial-time algorithm for a class of nonseparable convex maximization...
Two-machine open shop problem with controllable processing times
Two-machine open shop problem with controllable processing times
2007,
We consider a two-machine open shop problem in which the job processing times are...
Hard equality constrained integer knapsacks
Hard equality constrained integer knapsacks
2004,
We consider the following integer feasibility problem: Given positive integer numbers...
Hard problem generation for multidimensional knapsack problem
Hard problem generation for multidimensional knapsack problem
2005,
We developed generators that produce challenging Multidimensional Knapsack Problem...
An experimental study of random knapsack problems
An experimental study of random knapsack problems
2006,
The size of the Pareto curve for the bicriteria version of the knapsack problem is...
An empirical investigation on parallelization strategies for Scatter Search
An empirical investigation on parallelization strategies for Scatter Search
2006,
As other metaheuristics, Scatter Search can gain from a parallel implementation....
Tight oscillations tabu search for multidimensional knapsack problems with generalized upper bound constraints
Tight oscillations tabu search for multidimensional knapsack problems with generalized upper bound constraints
2005,
In a recent paper, the author and Curry solved the multidimensional knapsack problem...
The linear multiple choice knapsack problem with equity constraints
The linear multiple choice knapsack problem with equity constraints
2005,
In this paper, we introduce an important variation of a well known problem, the linear...
Exact and heuristic algorithms for dynamic tree simplification
Exact and heuristic algorithms for dynamic tree simplification
2005,
The Tree Knapsack Problem (TKP) is a (0–1) integer programming problem where...
A partitioning scheme for solving the 0–1 knapsack problem
A partitioning scheme for solving the 0–1 knapsack problem
2003,
The application of valid inequalities to provide relaxations which can produce tight...
Cover and pack inequalities for (mixed) integer programming
Cover and pack inequalities for (mixed) integer programming
2005,
We review strong inequalities for fundamental knapsack relaxations of (mixed) integer...
Papers per page: