AbstractWe consider a class of random knapsack instances described by Chvátal, who showed that with probability going to 1, such instances require an exponential number of branch-and-bound nodes. We show that even with the use of simple lifted cover inequalities, an exponential number of nodes is required with probability going to 1
This paper considers the polyhedral structure of the precedence-constrained knapsack problem, which ...
The submodular knapsack set is the discrete lower level set of a submodular function. The modular ca...
The 0-1 Multidimensional Knapsack Problem (0-1 MKP) is a well- known (and strongly N P -hard) combi...
AbstractIt is well known that one can obtain facets and valid inequalities for the knapsack polytope...
We investigate several complexity issues related to branch-and-cut algorithms for 0-1 integer progra...
Using a direct counting argument, we derive lower and upper bounds for the number of nodes enu-merat...
We provide new results on asymptotic values for the random knapsack problem. For a very general mode...
In this paper we study and solve two different variants of static knapsack problems with random weig...
AbstractWe present the first average-case analysis proving a polynomial upper bound on the expected ...
In this paper, we present the first average-case analysis proving an expected polynomial running tim...
In this paper, we present the first average-case analysis proving an expected polynomial running tim...
We present the first average-case analysis proving a polynomial upper bound on the expected running ...
The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on ave...
The 0–1 multidimensional knapsack problem (0–1 MKP) is a well-known (and strongly NP-hard) combinato...
AbstractWe provide new results on asymptotic values for the random knapsack problem. For a very gene...
This paper considers the polyhedral structure of the precedence-constrained knapsack problem, which ...
The submodular knapsack set is the discrete lower level set of a submodular function. The modular ca...
The 0-1 Multidimensional Knapsack Problem (0-1 MKP) is a well- known (and strongly N P -hard) combi...
AbstractIt is well known that one can obtain facets and valid inequalities for the knapsack polytope...
We investigate several complexity issues related to branch-and-cut algorithms for 0-1 integer progra...
Using a direct counting argument, we derive lower and upper bounds for the number of nodes enu-merat...
We provide new results on asymptotic values for the random knapsack problem. For a very general mode...
In this paper we study and solve two different variants of static knapsack problems with random weig...
AbstractWe present the first average-case analysis proving a polynomial upper bound on the expected ...
In this paper, we present the first average-case analysis proving an expected polynomial running tim...
In this paper, we present the first average-case analysis proving an expected polynomial running tim...
We present the first average-case analysis proving a polynomial upper bound on the expected running ...
The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on ave...
The 0–1 multidimensional knapsack problem (0–1 MKP) is a well-known (and strongly NP-hard) combinato...
AbstractWe provide new results on asymptotic values for the random knapsack problem. For a very gene...
This paper considers the polyhedral structure of the precedence-constrained knapsack problem, which ...
The submodular knapsack set is the discrete lower level set of a submodular function. The modular ca...
The 0-1 Multidimensional Knapsack Problem (0-1 MKP) is a well- known (and strongly N P -hard) combi...
DOI
Add to ORKG