This paper deals with the optimal solution to the sampled-data minimum variance filtering problem for linear systems with noise in the states and in the measurements. The solution is derived in the time-domain by using a fast sampling zeroorder hold input discretization of the continuous time systems together with a lifting technique. The original sampled-data system is transformed into an equi...

In this survey we attempt to give a unified presentation of a variety of results on the lifting of valid inequalities, as well as a standard procedure combining mixed integer rounding with lifting for the development of strong valid inequalities for knapsack and single node flow sets. Our hope is that the latter can be used in practice to generate cutting planes for mixed integer programs. The ...

We examine the feasibility polyhedron of the uncapacitated hub location problem (UHL) with multiple allocation, which has applications in the elds of air passenger and cargo transportation, telecommunication and postal delivery services. In particular we determine the dimension and derive some classes of facets for this polyhedron. We develop a general rule about lifting facets from the uncapac...

This paper describes computational experience obtained in the development of the lrs code, which uses the reverse search technique to solve the vertex enumeration/convex hull problem for d-dimensional convex polyhedra. We giv e empirical results showing improvements obtained by the use of lexicographic perturbation, lifting, and integer pivoting. We also give some indication of the cost of usin...

Cover inequalities are commonly used cutting planes for the 0–1 knapsack problem. This paper describes a linear-time algorithm (assuming the knapsack is sorted) to simultaneously lift a set of variables into a cover inequality. Conditions for this process to result in valid and facet-defining inequalities are presented. In many instances, the resulting simultaneously lifted cover inequality can...

This study examined the effects of 3 lifting ranges and 3 lifting modes on maximum lifting capability and total lifting time. The results demonstrated that the maximum lifting capability for FK (from floor to knuckle height) was greater than that for KS (from knuckle height to shoulder height) or FS (from floor to shoulder height). Additionally, asymmetric lifting with initial trunk rotation de...

In the pandiagonal Latin Square problem, a square grid of size N needs to be filled with N types of objects, so that each column, row, and wrapped around diagonal (both up and down) contains an object of each type. This problem dates back to at least Euler. In its specification as a constraint satisfaction problem, one uses the all different constraint. The known redundancy result about all dif...

In an earlier paper [I1 we characterized the class of facets of the set covering polytope defined by inequalities with coefficients equal to 0, 1 or S2. -iT this paper we connects/that characterization to the theory of facet lifting. In particular, we-introduc~ a family of lower dimensional polytopes and associated inequalities having only three nonzero coefficients, whose lifting yields all th...

We investigate the family of facet defining inequalities for the asymmetric traveling salesman (ATS) polytope obtainable by lifting the cycle inequalities. We establish several properties of this family that earmark it as the most important among the asymmetric inequalities for the ATS polytope known to date: (i) The family is shown to contain members of unbounded Chvatal rank, whereas most kno...

In this paper we study the dense elements and the radical of a residuated lattice, residuated lattices with lifting Boolean center, simple, local, semilocal and quasi-local residuated lattices. BL-algebras have lifting Boolean center; moreover, Glivenko residuated lattices which fulfill the equation (¬ a → ¬ b) → ¬ b = (¬ b → ¬ a) → ¬ a have lifting Boolean center.