Add to ORKGAbstract: On the unbounded knapsack problem, dominance relations play a crucial role to reduce items to be considered in a given instance. This article picks up two topics in dominance relations. One is a connection between dominance relations and polynomially solvable special cases, and the other is on unusual dominance relations
Professor Manne's paper recently appearing in this Journal (Manne, A. S. 1958. Programming of econom...
In this paper, we present the first average-case analysis proving an expected polynomial running tim...
The dominance conditional 'If I drink the contents of cup A, I will drink more than if drink the con...
Abstract: On the unbounded knapsack problem, dominance relations play a crucial role to reduce items...
We identify a polynomially solvable special case of the bounded knapsack problem that is characteriz...
We show that a combinatorial question which has been studied in connection with lower bounds for the...
International audienceThis paper deals with the computational complexity of some yes /no problems as...
Data instances for the journal article "Clique-based facets for the precedence constrained knapsack ...
Part II uses domination results in knapsack problems to assist in generating solutions more rapidly ...
Two common criticisms of Nash equilibrium are its dependence on very demanding epistemic assumptions...
AbstractWe show that a combinatorial question which has been studied in connection with lower bounds...
A variant of the classical knapsack problem is considered in which each item is associated with an i...
Artículo de publicación ISIWe consider the problem of separating maximally violated inequalities for...
In this paper, we present the first average-case analysis proving an expected polynomial running tim...
We investigate dominance relations between basic semidefinite relaxations and classes of cuts. We sh...
Professor Manne's paper recently appearing in this Journal (Manne, A. S. 1958. Programming of econom...
In this paper, we present the first average-case analysis proving an expected polynomial running tim...
The dominance conditional 'If I drink the contents of cup A, I will drink more than if drink the con...
Abstract: On the unbounded knapsack problem, dominance relations play a crucial role to reduce items...
We identify a polynomially solvable special case of the bounded knapsack problem that is characteriz...
We show that a combinatorial question which has been studied in connection with lower bounds for the...
International audienceThis paper deals with the computational complexity of some yes /no problems as...
Data instances for the journal article "Clique-based facets for the precedence constrained knapsack ...
Part II uses domination results in knapsack problems to assist in generating solutions more rapidly ...
Two common criticisms of Nash equilibrium are its dependence on very demanding epistemic assumptions...
AbstractWe show that a combinatorial question which has been studied in connection with lower bounds...
A variant of the classical knapsack problem is considered in which each item is associated with an i...
Artículo de publicación ISIWe consider the problem of separating maximally violated inequalities for...
In this paper, we present the first average-case analysis proving an expected polynomial running tim...
We investigate dominance relations between basic semidefinite relaxations and classes of cuts. We sh...
Professor Manne's paper recently appearing in this Journal (Manne, A. S. 1958. Programming of econom...
In this paper, we present the first average-case analysis proving an expected polynomial running tim...
The dominance conditional 'If I drink the contents of cup A, I will drink more than if drink the con...