<p>Given a 0-1 single dimension knapsack problem, this algorithm generates the set of cutting planes required to reduce the feasible region of the problem to the convex hull of feasible integer points.</p> <p>See README for more information and instructions.</p
© 2018, Pleiades Publishing, Ltd. We propose a method which belongs to a class of cutting methods fo...
The generalized knapsack problem or gknap is the combinatorial optimization problem of optimizing a ...
Cutting planes have been used with great success for solving mixed integer programs. In recent decad...
A systematic way for tightening an IP formulation is by employing classes of linear inequalities tha...
W1TR~tO-rA present a procedure which generates all the facets of a 0-1 programming polytope P with p...
The author recently introduced a new class of cutting planes for integer programs called Fenchel cut...
This paper introduces a scheme of deriving strong cutting planes for a general integer programming p...
The Knapsack Cryptosystem of Merkle and Hellman, 1978, is one of the earliest public-key cryptograph...
The Quadratic Knapsack Problem (QKP) is a well-known NP-hard combinatorial optimisation problem, wit...
International audienceThis paper presents a preprocessing procedure for the 0–1 multidimensional kna...
Copyright © by the paper's authors.An algorithm is suggested for solving a convex programming proble...
Copyright © by the paper's authors.An algorithm is suggested for solving a convex programming proble...
Copyright © by the paper's authors.An algorithm is suggested for solving a convex programming proble...
The facet of Knapsack ploytope, i.e. convex hull of 0-1 points satisfying a given linear inequality ...
The paper presents a new reformulation approach to reduce the complexity of a branch and bound algor...
© 2018, Pleiades Publishing, Ltd. We propose a method which belongs to a class of cutting methods fo...
The generalized knapsack problem or gknap is the combinatorial optimization problem of optimizing a ...
Cutting planes have been used with great success for solving mixed integer programs. In recent decad...
A systematic way for tightening an IP formulation is by employing classes of linear inequalities tha...
W1TR~tO-rA present a procedure which generates all the facets of a 0-1 programming polytope P with p...
The author recently introduced a new class of cutting planes for integer programs called Fenchel cut...
This paper introduces a scheme of deriving strong cutting planes for a general integer programming p...
The Knapsack Cryptosystem of Merkle and Hellman, 1978, is one of the earliest public-key cryptograph...
The Quadratic Knapsack Problem (QKP) is a well-known NP-hard combinatorial optimisation problem, wit...
International audienceThis paper presents a preprocessing procedure for the 0–1 multidimensional kna...
Copyright © by the paper's authors.An algorithm is suggested for solving a convex programming proble...
Copyright © by the paper's authors.An algorithm is suggested for solving a convex programming proble...
Copyright © by the paper's authors.An algorithm is suggested for solving a convex programming proble...
The facet of Knapsack ploytope, i.e. convex hull of 0-1 points satisfying a given linear inequality ...
The paper presents a new reformulation approach to reduce the complexity of a branch and bound algor...
© 2018, Pleiades Publishing, Ltd. We propose a method which belongs to a class of cutting methods fo...
The generalized knapsack problem or gknap is the combinatorial optimization problem of optimizing a ...
Cutting planes have been used with great success for solving mixed integer programs. In recent decad...
DOI
Add to ORKG