373 research outputs found
Recommended from our members
Zero-one IP problems: Polyhedral descriptions & cutting plane procedures
A systematic way for tightening an IP formulation is by employing classes of linear inequalities that define facets of the convex hull of the feasible integer points of the respective problems. Describing as well as identifying these inequalities will help in the efficiency of the LP-based cutting plane methods. In this report, we review classes of inequalities that partially described zero-one poly topes such as the 0-1 knapsack polytope, the set packing polytope and the travelling salesman polytope. Facets or valid inequalities derived from the 0-1 knapsack and the set packing polytopes are algorithmically identifie
Transitive Packing: A Unifying Concept in Combinatorial Optimization
This paper attempts to give a better understanding of the facial structure of previously separately investigated polyhedra. It introduces the notion of transitive packing and the transitive packing polytope. Polytopes that turn out to be special cases of the transitive packing polytope are, among others, the node packing polytope, the acyclic subdigraph polytope, the bipartite subgraph polytope, the planar subgraph polytope, the clique partitioning polytope, the partition polytope, the transitive acyclic subdigraph polytope, the interval order polytope, and the relatively transitive subgraph polytope. We give cutting plane proofs for several rich classes of valid inequalities of the transitive packing polytope,in this way introducing generalized cycle, generalized clique, generalized antihole, generalized antiweb, and odd partition inequalities. These classes subsume several known classes of valid inequalities for several of the special cases and give also many new inequalities for several other special cases. For some of the classes we also prove a lower bound for their Gomory-Chvdtal rank. Finally, we relate the concept of transitive packing to generalized (set) packing and covering as well as to balanced and ideal matrices
Euclidean distance geometry and applications
Euclidean distance geometry is the study of Euclidean geometry based on the
concept of distance. This is useful in several applications where the input
data consists of an incomplete set of distances, and the output is a set of
points in Euclidean space that realizes the given distances. We survey some of
the theory of Euclidean distance geometry and some of the most important
applications: molecular conformation, localization of sensor networks and
statics.Comment: 64 pages, 21 figure
A min-max relation for the partial q- colourings of a graph. Part II: Box perfection
AbstractThis paper examines extensions of a min-max equality (stated in C Berge, Part I) for the maximum number of nodes in a perfect graph which can be q-coloured.A system L of linear inequalities in the variables x is called TDI if for every linear function cx such that c is all integers, the dual of the linear program: maximize {cx: x satisfies L} has an integer-valued optimum solution or no optimum solution. A system L is called box TDI if L together with any inequalities l⩽x⩽u is TDI. It is a corollary of work of Fulkerson and Lov́asz that: where A is a 0–1 matrix with no all-0 column and with the 1-columns of any row not a proper subset of the 1-columns of any other row, the system L(G) = {Ax⩽1, x⩾0} is TDI if and only if A is the matrix of maximal cliques (rows) versus nodes (columns) of a perfect graph. Here we will describe a class of graphs in a graph-theoretic way, and characterize them as the graphs G for which the system L(G) is box TDI. Thus we call these graphs box perfect. We also describe some classes of box perfect graphs
- …