We show that a natural robust optimization variant of the knapsack problem is complete for the second level of the polynomial hierarchy
The knapsack problem is a classical combinatorial optimization problem used to model many industrial...
We consider a generalization of the 0-1 knapsack problem in which the profit of each item can take a...
We consider a generalization of the 0-1 knapsack problem in which the profit of each item can take a...
We show that a natural robust optimization variant of the knapsack problem is complete for the secon...
We show that a natural robust optimization variant of the knapsack problem is complete for the secon...
We show that a natural robust optimization variant of the knapsack problem is complete for the secon...
We show that a natural robust optimization variant of the knapsack problem is complete for the secon...
We show that a natural robust optimization variant of the knapsack problem is complete for the secon...
We show that a natural robust optimization variant of the knapsack problem is complete for the secon...
AbstractWe show that a natural robust optimization variant of the knapsack problem is complete for t...
We consider a generalization of the 0-1 knapsack problem in which the profit of each item can take a...
We consider a generalization of the 0–1 knapsack problem in which the profit of each item can take a...
International audienceThe knapsack problem is a classical combinatorial optimization problem used to...
We consider a generalization of the 0–1 knapsack problem in which the profit of each item can take a...
none4siWe consider a generalization of the 0–1 knapsack problem in which the profit of each item can...
The knapsack problem is a classical combinatorial optimization problem used to model many industrial...
We consider a generalization of the 0-1 knapsack problem in which the profit of each item can take a...
We consider a generalization of the 0-1 knapsack problem in which the profit of each item can take a...
We show that a natural robust optimization variant of the knapsack problem is complete for the secon...
We show that a natural robust optimization variant of the knapsack problem is complete for the secon...
We show that a natural robust optimization variant of the knapsack problem is complete for the secon...
We show that a natural robust optimization variant of the knapsack problem is complete for the secon...
We show that a natural robust optimization variant of the knapsack problem is complete for the secon...
We show that a natural robust optimization variant of the knapsack problem is complete for the secon...
AbstractWe show that a natural robust optimization variant of the knapsack problem is complete for t...
We consider a generalization of the 0-1 knapsack problem in which the profit of each item can take a...
We consider a generalization of the 0–1 knapsack problem in which the profit of each item can take a...
International audienceThe knapsack problem is a classical combinatorial optimization problem used to...
We consider a generalization of the 0–1 knapsack problem in which the profit of each item can take a...
none4siWe consider a generalization of the 0–1 knapsack problem in which the profit of each item can...
The knapsack problem is a classical combinatorial optimization problem used to model many industrial...
We consider a generalization of the 0-1 knapsack problem in which the profit of each item can take a...
We consider a generalization of the 0-1 knapsack problem in which the profit of each item can take a...
DOI
Add to ORKG