Keyword: knapsack problem

Found 169 papers in total
GRASP with path relinking for the orienteering problem
GRASP with path relinking for the orienteering problem
2014,
In this paper, we address an optimization problem resulting from the combination of...
Bayesian optimal knapsack procurement
Bayesian optimal knapsack procurement
2014,
A budget‐constrained buyer wants to purchase items from a shortlisted set....
Complexity Results and Exact Algorithms for Robust Knapsack Problems
Complexity Results and Exact Algorithms for Robust Knapsack Problems
2014,
This paper studies the robust knapsack problem, for which solutions are, up to a...
Uncommon Dantzig‐Wolfe Reformulation for the Temporal Knapsack Problem
Uncommon Dantzig‐Wolfe Reformulation for the Temporal Knapsack Problem
2013,
We study a natural generalization of the knapsack problem, in which each item exists...
Algorithmic improvements on dynamic programming for the bi‐objective {0,1} knapsack problem
Algorithmic improvements on dynamic programming for the bi‐objective {0,1} knapsack problem
2013,
This paper presents several methodological and algorithmic improvements over a...
A well‐solvable special case of the bounded knapsack problem
A well‐solvable special case of the bounded knapsack problem
2011,
We identify a polynomially solvable special case of the bounded knapsack problem that...
Optimal keyword bidding in search‐based advertising with target exposure levels
Optimal keyword bidding in search‐based advertising with target exposure levels
2013,
Search‐based advertising has become very popular since it provides advertisers...
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...
Gradual Sub‐lattice Reduction and a New Complexity for Factoring Polynomials
Gradual Sub‐lattice Reduction and a New Complexity for Factoring Polynomials
2012,
We present a lattice algorithm specifically designed for some classical applications...
An algorithm for the disjunctively constrained knapsack problem
An algorithm for the disjunctively constrained knapsack problem
2012,
This paper proposes an adaptation of the scatter search (SS)...
Exact algorithms for the two‐dimensional guillotine knapsack
Exact algorithms for the two‐dimensional guillotine knapsack
2012,
The two‐dimensional knapsack problem requires to pack a maximum profit subset...
Knapsack problem with probability constraints
Knapsack problem with probability constraints
2011,
This paper is dedicated to a study of different extensions of the classical knapsack...
Recoverable robust knapsacks: the discrete scenario case
Recoverable robust knapsacks: the discrete scenario case
2011,
The knapsack problem is one of the basic problems in combinatorial optimization. In...
Minimal Equivalent Binary Knapsack Inequalities
Minimal Equivalent Binary Knapsack Inequalities
2011,
It is known that a knapsack inequality can be reduced to one having the same solutions...
Tight bounds for periodicity theorems on the unbounded Knapsack problem
Tight bounds for periodicity theorems on the unbounded Knapsack problem
2011,
Three new bounds for periodicity theorems on the unbounded Knapsack problem are...
A dynamic programming method with lists for the knapsack sharing problem
A dynamic programming method with lists for the knapsack sharing problem
2011,
In this paper, we propose a method to solve exactly the knapsack sharing problem (KSP)...
Unbounded knapsack problems with arithmetic weight sequences
Unbounded knapsack problems with arithmetic weight sequences
2011,
We investigate a special case of the unbounded knapsack problem in which the item...
Local branching‐based algorithms for the disjunctively constrained knapsack problem
Local branching‐based algorithms for the disjunctively constrained knapsack problem
2011,
The disjunctively constrained knapsack problem (DCKP) is a variant of the...
Identifying preferred solutions to Multi‐Objective Binary Optimisation problems, with an application to the Multi‐Objective Knapsack Problem
Identifying preferred solutions to Multi‐Objective Binary Optimisation problems, with an application to the Multi‐Objective Knapsack Problem
2011,
In this paper we present a new framework for identifying preferred solutions to...
A multiobjective metaheuristic for a mean-risk static stochastic knapsack problem
A multiobjective metaheuristic for a mean-risk static stochastic knapsack problem
2010,
In this paper we address two major challenges presented by stochastic discrete...
The multidimensional knapsack problem: Structure and algorithms
The multidimensional knapsack problem: Structure and algorithms
2010,
We study the multidimensional knapsack problem, present some theoretical and empirical...
A dynamic programming algorithm for the bilevel knapsack problem
A dynamic programming algorithm for the bilevel knapsack problem
2009,
We propose an efficient dynamic programming algorithm for solving a bilevel program...
New pseudopolynomial complexity bounds for the bounded and other integer Knapsack related problems
New pseudopolynomial complexity bounds for the bounded and other integer Knapsack related problems
2009,
We consider the bounded integer knapsack problem (BKP) max Σ j = 1 n p j x j ,...
Upper bounds for the 0-1 stochastic knapsack problem and a B&B algorithm
Upper bounds for the 0-1 stochastic knapsack problem and a B&B algorithm
2010,
In this paper we study and solve two different variants of static knapsack problems...
Papers per page: