An all-different constraint for a given family of discrete variables imposes the condition that no two variables in the family are allowed to take the same value. Magos et al. [Mathematical Programming, 132 (2012), pp. 209–260] gave a linear-inequality description of the convex hull of solutions to a system of all-different constraints, under a special assumption called inclusion property. The convex hull of solutions is in this case the intersection of the convex hulls of each of the all-different constraints of the system. We give a short and simple proof of this result, that in addition shows the total dual integrality of the linear system
AbstractThis paper deals with systems of an arbitrary (possibly infinite) number of both weak and st...
This paper gives several characterizations of the solution set of convex programs. No differentiabi...
This paper deals with systems of an arbitrary (possibly infinite) number of both weak and strict lin...
This paper examines the facial structure of the convex hull of integer vectors satisfying a system o...
This paper examines the facial structure of the convex hull of integer vectors satisfying a system o...
We consider mixed-integer sets defined by a linear system Ax >= b plus an integrality requirement on...
We consider mixed-integer sets defined by a linear system Ax >= b plus an integrality requirement on...
The evenly convex hull of a given set is the intersection of all the open halfspaces which contain ...
The topic of this thesis is the convex hull property for systems of partial differential equations, ...
A system of linear inequality and equality constraints determines a convex polyhedral set of feasibl...
In this article we discuss weak and strong duality properties of convex semi-infinite programming pr...
Problems of minimizing a convex function or maximizing a concave function over a convex set are call...
Problems of minimizing a convex function or maximizing a concave function over a convex set are call...
Theorems on the convex hull of an extended real-valued function living on a Hilbert space are presen...
Summary. Convexity is one of the most important concepts in a study of analysis. Especially, it has ...
AbstractThis paper deals with systems of an arbitrary (possibly infinite) number of both weak and st...
This paper gives several characterizations of the solution set of convex programs. No differentiabi...
This paper deals with systems of an arbitrary (possibly infinite) number of both weak and strict lin...
This paper examines the facial structure of the convex hull of integer vectors satisfying a system o...
This paper examines the facial structure of the convex hull of integer vectors satisfying a system o...
We consider mixed-integer sets defined by a linear system Ax >= b plus an integrality requirement on...
We consider mixed-integer sets defined by a linear system Ax >= b plus an integrality requirement on...
The evenly convex hull of a given set is the intersection of all the open halfspaces which contain ...
The topic of this thesis is the convex hull property for systems of partial differential equations, ...
A system of linear inequality and equality constraints determines a convex polyhedral set of feasibl...
In this article we discuss weak and strong duality properties of convex semi-infinite programming pr...
Problems of minimizing a convex function or maximizing a concave function over a convex set are call...
Problems of minimizing a convex function or maximizing a concave function over a convex set are call...
Theorems on the convex hull of an extended real-valued function living on a Hilbert space are presen...
Summary. Convexity is one of the most important concepts in a study of analysis. Especially, it has ...
AbstractThis paper deals with systems of an arbitrary (possibly infinite) number of both weak and st...
This paper gives several characterizations of the solution set of convex programs. No differentiabi...
This paper deals with systems of an arbitrary (possibly infinite) number of both weak and strict lin...