Gomory mixed-integer cuts are one of the key components in Branch-and-Cut solvers for mixed-integer linear programs. The textbook formula for generating these cuts is not used directly in open-source and commercial software due to the limited numerical precision of the computations: Additional steps are performed to avoid the generation of invalid cuts. This paper studies the impact of some of these steps on the safety of Gomory mixed-integer cut generators. As the generation of invalid cuts is a relatively rare event, the experimental design for this study is particularly important. We propose an experimental setup that allows statistically significant comparisons of generators. We also propose a parameter optimization algorithm and use it...
Embedding cuts into a branch-and-cut framework is a delicate task, the main so when the implemented ...
We present pure-integer Gomory cuts in a way so that they are derived with respect to a “dual form” ...
Abstract. Current mixed-integer linear programming solvers are based on linear programming routines ...
We investigate the use of Gomory's mixed integer cuts within a branch-and-cut framework. It has...
Gomory mixed-integer cuts (GMICs) are widely used in modern branch-and-cut codes for the solution of...
In this paper, a methodology for testing the accuracy and strength of cut generators for mixed-integ...
Gomory Mixed-Integer Cuts (GMICs) are widely used in modern branch-and-cut codes for the solution of...
Mixed-integer Gomory cuts have become an integral part of state-of-the-art software for solving mixe...
Mixed-integer Gomory cuts have become an integral part of state-of-the-art software for solving mixe...
This thesis is an expository work based on the paper Integer Programming by Joe Wampler and Steve ...
Split cuts represent the most widely used class of cutting planes currently employed by state-of-the...
Resumo: Em 1958, Gomory propôs uma desigualdade válida ou corte a partir do tableau do método simple...
For an integer program, a k-cut is a cutting plane generated by the Gomory mixed integer procedure f...
This is an experimental study of algorithms for the cut tree problem. We study the Gomory-Hu and Gus...
We investigate the use of cutting planes for integer programs with general integer variables. We sho...
Embedding cuts into a branch-and-cut framework is a delicate task, the main so when the implemented ...
We present pure-integer Gomory cuts in a way so that they are derived with respect to a “dual form” ...
Abstract. Current mixed-integer linear programming solvers are based on linear programming routines ...
We investigate the use of Gomory's mixed integer cuts within a branch-and-cut framework. It has...
Gomory mixed-integer cuts (GMICs) are widely used in modern branch-and-cut codes for the solution of...
In this paper, a methodology for testing the accuracy and strength of cut generators for mixed-integ...
Gomory Mixed-Integer Cuts (GMICs) are widely used in modern branch-and-cut codes for the solution of...
Mixed-integer Gomory cuts have become an integral part of state-of-the-art software for solving mixe...
Mixed-integer Gomory cuts have become an integral part of state-of-the-art software for solving mixe...
This thesis is an expository work based on the paper Integer Programming by Joe Wampler and Steve ...
Split cuts represent the most widely used class of cutting planes currently employed by state-of-the...
Resumo: Em 1958, Gomory propôs uma desigualdade válida ou corte a partir do tableau do método simple...
For an integer program, a k-cut is a cutting plane generated by the Gomory mixed integer procedure f...
This is an experimental study of algorithms for the cut tree problem. We study the Gomory-Hu and Gus...
We investigate the use of cutting planes for integer programs with general integer variables. We sho...
Embedding cuts into a branch-and-cut framework is a delicate task, the main so when the implemented ...
We present pure-integer Gomory cuts in a way so that they are derived with respect to a “dual form” ...
Abstract. Current mixed-integer linear programming solvers are based on linear programming routines ...