247 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
Polyhedral techniques in combinatorial optimization II: computations
Combinatorial optimization problems appear in many disciplines ranging from management and logistics to mathematics, physics, and chemistry. These problems are usually relatively easy to formulate mathematically, but most of them are computationally hard due to the restriction that a subset of the variables have to take integral values. During the last two decades there has been a remarkable progress in techniques based on the polyhedral description of combinatorial problems. leading to a large increase in the size of several problem types that can be solved. The basic idea behind polyhedral techniques is to derive a good linear formulation of the set of solutions by identifying linear inequalities that can be proved to be necessary in the description of the convex hull of feasible solutions. Ideally we can then solve the problem as a linear programming problem, which can be done efficiently. The purpose of this manuscript is to give an overview of the developments in polyhedral theory, starting with the pioneering work by Dantzig, Fulkerson and Johnson on the traveling salesman problem, and by Gomory on integer programming. We also present some modern applications, and computational experience
Polyhredral techniques in combinatorial optimization I: theory
Combinatorial optimization problems appear in many disciplines ranging
from management and logistics to mathematics, physics, and chemistry. These
problems are usually relatively easy to formulate mathematically, but most
of them are computationally hard due to the restriction that a subset of the
variables have to take integral values. During the last two decades there has
been a remarkable progress in techniques based on the polyhedral description
of combinatorial problems, leading to a large increase in the size of several
problem types that can be solved. The basic idea behind polyhedral techniques
is to derive a good linear formulation of the set of solutions by identifying
linear inequalities that can be proved to be necessary in the description of the
convex hull of feasible solutions. Ideally we can then solve the problem as
a linear programming problem, which can be done eciently. The purpose of
this manuscript is to give an overview of the developments in polyhedral theory,
starting with the pioneering work by Dantzig, Fulkerson and Johnson on the
traveling salesman problem, and by Gomory on integer programming. We also
present some modern applications, and computational experience
A Lagrangian relaxation approach to the edge-weighted clique problem
The -clique polytope is the convex hull of the node and edge incidence vectors of all subcliques of size at most of a complete graph on nodes. Including the Boolean quadric polytope as a special case and being closely related to the quadratic knapsack polytope, it has received considerable attention in the literature. In particular, the max-cut problem is equivalent with optimizing a linear function over . The problem of optimizing linear functions over has so far been approached via heuristic combinatorial algorithms and cutting-plane methods. We study the structure of in further detail and present a new computational approach to the linear optimization problem based on Lucena's suggestion of integrating cutting planes into a Lagrangian relaxation of an integer programming problem. In particular, we show that the separation problem for tree inequalities becomes polynomial in our Lagrangian framework. Finally, computational results are presented. \u
- …