56 research outputs found
Polyhedral techniques in combinatorial optimization II: applications and computations
The polyhedral approach is one of the most powerful techniques available for solving hard combinatorial optimization problems. The main idea behind the technique is to consider the linear relaxation of the integer combinatorial optimization problem, and try to iteratively strengthen the linear formulation by adding violated strong valid inequalities, i.e., inequalities that are violated by the current fractional solution but satisfied by all feasible solutions, and that define high-dimensional faces, preferably facets, of the convex hull of feasible solutions. If we have the complete description of the convex hull of feasible solutions at hand all extreme points of this formulation are integral, which means that we can solve the problem as a linear programming problem. Linear programming problems are known to be computationally easy. In Part 1 of this article we discuss theoretical aspects of polyhedral techniques. Here we will mainly concentrate on the computational aspects. In particular we discuss how polyhedral results are used in cutting plane algorithms. We also consider a few theoretical issues not treated in Part 1, such as techniques for proving that a certain inequality is facet defining, and that a certain linear formulation gives a complete description of the convex hull of feasible solutions. We conclude the article by briefly mentioning some alternative techniques for solving combinatorial optimization problems
Primary Facets Of Order Polytopes
Mixture models on order relations play a central role in recent
investigations of transitivity in binary choice data. In such a model, the
vectors of choice probabilities are the convex combinations of the
characteristic vectors of all order relations of a chosen type. The five
prominent types of order relations are linear orders, weak orders, semiorders,
interval orders and partial orders. For each of them, the problem of finding a
complete, workable characterization of the vectors of probabilities is
crucial---but it is reputably inaccessible. Under a geometric reformulation,
the problem asks for a linear description of a convex polytope whose vertices
are known. As for any convex polytope, a shortest linear description comprises
one linear inequality per facet. Getting all of the facet-defining inequalities
of any of the five order polytopes seems presently out of reach. Here we search
for the facet-defining inequalities which we call primary because their
coefficients take only the values -1, 0 or 1. We provide a classification of
all primary, facet-defining inequalities of three of the five order polytopes.
Moreover, we elaborate on the intricacy of the primary facet-defining
inequalities of the linear order and the weak order polytopes
Properties of some ILP formulations of a class of partitioning problems
AbstractWe discuss possible integer linear programming formulations of a class of partitioning problems, which includes vertex (and edge) coloring and bin packing, and present some basic properties of the associated linear programming relaxations, possibly improved by means of valid inequalities. In particular, we show that these relaxations are sometimes easily solved without resorting to an LP solver, and derive the worst-case performance of the associated bound on the optimal solution value. We also show which is the contribution of each inequality to this bound. Our analysis provides a general framework to unify and generalize some results previously presented in the literature, and should be taken into account whenever one considers the possibility of using the formulations addressed
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization
International audienceThe Cologne-Twente Workshop (CTW) on Graphs and Combinatorial Optimization started off as a series of workshops organized bi-annually by either Köln University or Twente University. As its importance grew over time, it re-centered its geographical focus by including northern Italy (CTW04 in Menaggio, on the lake Como and CTW08 in Gargnano, on the Garda lake). This year, CTW (in its eighth edition) will be staged in France for the first time: more precisely in the heart of Paris, at the Conservatoire National d’Arts et Métiers (CNAM), between 2nd and 4th June 2009, by a mixed organizing committee with members from LIX, Ecole Polytechnique and CEDRIC, CNAM
- …