Add to ORKGBased on the isometric plane method for linear programming, an algorithm for integer linear programming is proposed in this paper. The algorithm can quickly obtain the optimal integer point simultaneously using isometric planes and cutting planes derived from polyhedral-cones, rounded-minimal-balls and second-rounded-balls at the highest vertex and its neighboring vertices
Cutting plane methods and Lagrangian relaxation have both proven to be powerful methods in the solut...
We consider the integer points in a unimodular cone K ordered by a lexicographic rule defined by a l...
We consider a new finitely convergent cutting plane algorithm for mixed integer linear programs in w...
Based on the isometric plane method for linear programming, an algorithm for integer linear programm...
Based on the isometric plane method for linear programming, an algorithm for integer linear programm...
In this paper we solve mixed-integer linear programming including integer linear programming by isom...
In this paper, we solve strict mixed-integer linear programming not including integer linear program...
An algorithm is presented for solving families of integer linear programming problems in which the p...
In this thesis, we study theoretical aspects of integer linear programming. This thesis consists of...
w9255960 Integer programming (IP) problems are difficult to solve due to the integer restrictions im...
We propose an interactive approach for multiple objective integer linear programming (MOILP) problem...
The paper describes a method to solve an ILP by describing whether an approximated integer solution ...
Linear programming (LP) is one of the most widely-applied techniques in operations research. Many me...
Linear programming is a relatively new, very important branch of modern mathematics and is about twe...
An algorithm that solves a linear program by using planes exterior to the feasible region is descri...
Cutting plane methods and Lagrangian relaxation have both proven to be powerful methods in the solut...
We consider the integer points in a unimodular cone K ordered by a lexicographic rule defined by a l...
We consider a new finitely convergent cutting plane algorithm for mixed integer linear programs in w...
Based on the isometric plane method for linear programming, an algorithm for integer linear programm...
Based on the isometric plane method for linear programming, an algorithm for integer linear programm...
In this paper we solve mixed-integer linear programming including integer linear programming by isom...
In this paper, we solve strict mixed-integer linear programming not including integer linear program...
An algorithm is presented for solving families of integer linear programming problems in which the p...
In this thesis, we study theoretical aspects of integer linear programming. This thesis consists of...
w9255960 Integer programming (IP) problems are difficult to solve due to the integer restrictions im...
We propose an interactive approach for multiple objective integer linear programming (MOILP) problem...
The paper describes a method to solve an ILP by describing whether an approximated integer solution ...
Linear programming (LP) is one of the most widely-applied techniques in operations research. Many me...
Linear programming is a relatively new, very important branch of modern mathematics and is about twe...
An algorithm that solves a linear program by using planes exterior to the feasible region is descri...
Cutting plane methods and Lagrangian relaxation have both proven to be powerful methods in the solut...
We consider the integer points in a unimodular cone K ordered by a lexicographic rule defined by a l...
We consider a new finitely convergent cutting plane algorithm for mixed integer linear programs in w...