We investigate several complexity issues related to branch-and-cut algorithms for 0-1 integer programming based on lifted cover inequalities (LCIs). We showthat given a fractional point, determining a violated LCI over all minimal covers is NPhard. The main result is that there exists a class of 0-1 knapsack instances for which any branch-and-cut algorithm based on LCIs has to evaluate an exponential number of nodes to prove optimality
The submodular knapsack set is the discrete lower level set of a submodular function. The modular ca...
AbstractAlready 30 years ago, Chvátal has shown that some instances of the zero-one knapsack problem...
The branch-and-cut algorithm for integer programming has a wide variety of tunable parameters that h...
The 0-1 Multidimensional Knapsack Problem (0-1 MKP) is a well- known (and strongly N P -hard) combi...
Lifted cover inequalities are well-known cutting planes for 0-1 linear programs. We show how one of ...
We study the mixed 0-1 knapsack polytope, which is defined by a single knapsack constraint that cont...
Using a direct counting argument, we derive lower and upper bounds for the number of nodes enu-merat...
This paper considers the polyhedral structure of the precedence-constrained knapsack problem, which ...
We present new valid inequalities for 0-1 programming problems that work in similar ways to well kno...
AbstractWe consider a class of random knapsack instances described by Chvátal, who showed that with ...
Cataloged from PDF version of article.We present new valid inequalities for 0-1 programming problems...
Many problems arising in OR/MS can be formulated as mixed-integer linear programs (MILPs): see the a...
AbstractThis paper considers the polyhedral structure of the precedence-constrained knapsack problem...
We introduce a new class of valid inequalities for general integer linear programs, called binary cl...
Valid inequalities for 0-1 knapsack polytopes often prove useful when tackling hard 0-1 Linear Progr...
The submodular knapsack set is the discrete lower level set of a submodular function. The modular ca...
AbstractAlready 30 years ago, Chvátal has shown that some instances of the zero-one knapsack problem...
The branch-and-cut algorithm for integer programming has a wide variety of tunable parameters that h...
The 0-1 Multidimensional Knapsack Problem (0-1 MKP) is a well- known (and strongly N P -hard) combi...
Lifted cover inequalities are well-known cutting planes for 0-1 linear programs. We show how one of ...
We study the mixed 0-1 knapsack polytope, which is defined by a single knapsack constraint that cont...
Using a direct counting argument, we derive lower and upper bounds for the number of nodes enu-merat...
This paper considers the polyhedral structure of the precedence-constrained knapsack problem, which ...
We present new valid inequalities for 0-1 programming problems that work in similar ways to well kno...
AbstractWe consider a class of random knapsack instances described by Chvátal, who showed that with ...
Cataloged from PDF version of article.We present new valid inequalities for 0-1 programming problems...
Many problems arising in OR/MS can be formulated as mixed-integer linear programs (MILPs): see the a...
AbstractThis paper considers the polyhedral structure of the precedence-constrained knapsack problem...
We introduce a new class of valid inequalities for general integer linear programs, called binary cl...
Valid inequalities for 0-1 knapsack polytopes often prove useful when tackling hard 0-1 Linear Progr...
The submodular knapsack set is the discrete lower level set of a submodular function. The modular ca...
AbstractAlready 30 years ago, Chvátal has shown that some instances of the zero-one knapsack problem...
The branch-and-cut algorithm for integer programming has a wide variety of tunable parameters that h...
Add to ORKG