Add to ORKGIn this paper we consider an infinite relaxation of the mixed integer linear program with two integer variables, nonnegative continuous variables and two equality constraints, and we give a complete characterization of its facets. We also derive an analogous characterization of the facets of the underlying finite integer program
We study a mixed integer linear program with m integer variables and k non-negative continu...
The theory of duality for linear programs is well-developed and has been successful in advancing bot...
We study the problem of finding a set of constraints of minimum cardinality which when relaxed in an...
In this paper we consider an infinite relaxation of the mixed integer linear program with two intege...
In this paper we consider a semi-infinite relaxation of mixed integer linear programs. We show that ...
AbstractThis paper is concerned with the generation of tight equivalent representations for mixed-in...
Recently minimal and extreme inequalities for continuous group relaxations of general mixed integer ...
Recently minimal and extreme inequalities for continuous group relaxations of general mixed integer ...
The problem of integer programming in bounded variables, over constraints with no more than twovari...
A new, simple, constraint qualification for infinite dimensional programs with linear programming ty...
My work focuses on cutting planes technology in Mixed Integer Programming. I explore novel classes o...
AbstractWe define the concept of a representation of a set of either linear constraints in bounded i...
A mixed-integer program is an optimization problem where one is required to minimize a linear functi...
This dissertation is devoted to solving general mixed integer optimization problems. Our main focus ...
We study a mixed integer linear program with m integer variables and k non-negative continuous varia...
We study a mixed integer linear program with m integer variables and k non-negative continu...
The theory of duality for linear programs is well-developed and has been successful in advancing bot...
We study the problem of finding a set of constraints of minimum cardinality which when relaxed in an...
In this paper we consider an infinite relaxation of the mixed integer linear program with two intege...
In this paper we consider a semi-infinite relaxation of mixed integer linear programs. We show that ...
AbstractThis paper is concerned with the generation of tight equivalent representations for mixed-in...
Recently minimal and extreme inequalities for continuous group relaxations of general mixed integer ...
Recently minimal and extreme inequalities for continuous group relaxations of general mixed integer ...
The problem of integer programming in bounded variables, over constraints with no more than twovari...
A new, simple, constraint qualification for infinite dimensional programs with linear programming ty...
My work focuses on cutting planes technology in Mixed Integer Programming. I explore novel classes o...
AbstractWe define the concept of a representation of a set of either linear constraints in bounded i...
A mixed-integer program is an optimization problem where one is required to minimize a linear functi...
This dissertation is devoted to solving general mixed integer optimization problems. Our main focus ...
We study a mixed integer linear program with m integer variables and k non-negative continuous varia...
We study a mixed integer linear program with m integer variables and k non-negative continu...
The theory of duality for linear programs is well-developed and has been successful in advancing bot...
We study the problem of finding a set of constraints of minimum cardinality which when relaxed in an...