Given a linear inequality in 0–1 variables we attempt to obtain the faces of the integer hull of 0–1 feasible solutions. For the given inequality we specify how faces of a variety of lower-dimensional inequalities can be raised to give full-dimensional faces. In terms of a set, called a ldquostrong coverrdquo, we obtain necessary and sufficient conditions for any inequality with 0–1 coefficients to be a face, and characterize different forms that the integer hull must take. In general the suggested procedures fail to produce the complete integer hull. Special subclasses of inequalities for which all faces can be generated are demonstrated. These include the ldquomatroidalrdquo and ldquographicrdquo inequalities, where a count on the number ...
A linear matrix inequality (LMI) is a condition stating that a symmetric matrix whose entries are af...
Cutting planes are a key ingredient to successfully solve mixed-integer linear programs. For specifi...
We provide a simple description in terms of linear inequalities of the convex hull of the nonnegativ...
The facet of Knapsack ploytope, i.e. convex hull of 0-1 points satisfying a given linear inequality ...
We provide a simple description in terms of linear inequalities of the convex hull of the nonnegativ...
A d-dimensional face of the grid [k]n = {0, ... , k−s1}n is a set of the form {X ∈ [k]n}:xi1=a1..., ...
A d-dimensional face of the grid [k]n = {0, ... , k−s1}n is a set of the form {X ∈ [k]n}:xi1=a1..., ...
Abstract. A linear matrix inequality (LMI) is a condition stating that a symmetric matrix whose entr...
We show how the resolution method of theorem proving can be extended to obtain a procedure for solvi...
) Jeff Erickson Computer Science Division University of California Berkeley, CA 94720-1776 jeffe@cs....
AbstractLet K1 and K2 be proper cones in the finite dimensional real vector spaces V1 and V2 respect...
A linear matrix inequality (LMI) is a condition stating that a symmetric matrix whose entries are af...
Many problems arising in OR/MS can be formulated as mixed-integer linear programs (MILPs): see the a...
none4siWe provide a simple description in terms of linear inequalities of the convex hull of the non...
AbstractThis paper is divided into two parts. In the first part, suppose that K1 and K2 are proper c...
A linear matrix inequality (LMI) is a condition stating that a symmetric matrix whose entries are af...
Cutting planes are a key ingredient to successfully solve mixed-integer linear programs. For specifi...
We provide a simple description in terms of linear inequalities of the convex hull of the nonnegativ...
The facet of Knapsack ploytope, i.e. convex hull of 0-1 points satisfying a given linear inequality ...
We provide a simple description in terms of linear inequalities of the convex hull of the nonnegativ...
A d-dimensional face of the grid [k]n = {0, ... , k−s1}n is a set of the form {X ∈ [k]n}:xi1=a1..., ...
A d-dimensional face of the grid [k]n = {0, ... , k−s1}n is a set of the form {X ∈ [k]n}:xi1=a1..., ...
Abstract. A linear matrix inequality (LMI) is a condition stating that a symmetric matrix whose entr...
We show how the resolution method of theorem proving can be extended to obtain a procedure for solvi...
) Jeff Erickson Computer Science Division University of California Berkeley, CA 94720-1776 jeffe@cs....
AbstractLet K1 and K2 be proper cones in the finite dimensional real vector spaces V1 and V2 respect...
A linear matrix inequality (LMI) is a condition stating that a symmetric matrix whose entries are af...
Many problems arising in OR/MS can be formulated as mixed-integer linear programs (MILPs): see the a...
none4siWe provide a simple description in terms of linear inequalities of the convex hull of the non...
AbstractThis paper is divided into two parts. In the first part, suppose that K1 and K2 are proper c...
A linear matrix inequality (LMI) is a condition stating that a symmetric matrix whose entries are af...
Cutting planes are a key ingredient to successfully solve mixed-integer linear programs. For specifi...
We provide a simple description in terms of linear inequalities of the convex hull of the nonnegativ...