One cutting plane algorithm using auxiliary functions

A Cutting-Plane Alternating Projections Algorithm A Cutting-Plane, Alternating Projections Algorithm for Conic Optimization Problems

We introduce a hybrid projection-localization method for solving large convex cone programs. The method interleaves a series of projections onto localization sets with the classical alternating projections method for convex feasibility problems; the problem is made amenable to the method by reducing it to a convex feasibility problem composed of a subspace and a cone via its homogeneous self-du...

An ACO algorithm for one-dimensional cutting stock problem

The one-dimensional cutting stock problem, has so many applications in lots of industrial processes and during the past few years has attracted so many researchers’ attention all over the world. In this paper a meta-heuristic method based on ACO is presented to solve this problem. In this algorithm, based on designed probabilistic laws, artificial ants do select various cuts and then select the...

A cutting plane algorithm for graph coloring

We present an approach based on integer programming formulations of the graph coloring problem. Our goal is to develop models that remove some symmetrical solutions obtained by color permutations. We study the problem from a polyhedral point of view and determine some families of facets of the 0/1-polytope associated with one of these integer programming formulations. The theoretical results de...

Estimating Heights Using Auxiliary Functions

Several recent papers construct auxiliary polynomials to bound the Weil height of certain classes of algebraic numbers from below. Following these techniques, the author gave a general method for introducing auxiliary polynomials to problems involving the Weil height. The height appears as a solution to a certain extremal problem involving polynomials. We further generalize the above techniques...

A Cutting Plane Algorithm for the One - DimensionalCutting Sto k Problem with Multiple