Results 241 to 250 of about 350,084 (285)

Valid inequalities for binary linear codes

2009 IEEE International Symposium on Information Theory, 2009
We study an integer programming (IP) based separation approach to find the maximum likelihood (ML) codeword for binary linear codes. An algorithm introduced in Tanatmis et al. is extended and improved with respect to decoding performance without increasing the worst case complexity. This is demonstrated on the LDPC and the BCH code classes.
Akin Tanatmis, Stefan Ruzika, Horst W. Hamacher, Mayur Punekar, Frank Kienle, Norbert Wehn   +5 more
openaire   +1 more source

Proving inductive validity of constrained inequalities

Proceedings of the 18th International Symposium on Principles and Practice of Declarative Programming, 2016
Rewriting induction (RI) frameworks consist of inference rules to prove equations to be inductive theorems of a given term rewriting system, i.e., to be inductively valid w.r.t. reduction of the given system. To prove inductive validity of inequalities within such frameworks, one may reduce inequalities to equations.
Takahiro Nagao, Naoki Nishida
openaire   +1 more source

Minimal Valid Inequalities for Integer Constraints

Mathematics of Operations Research, 2009
In this paper, we consider a semi-infinite relaxation of mixed-integer linear programs. We show that minimal valid inequalities for this relaxation correspond to maximal lattice-free convex sets, and that they arise from nonnegative, piecewise linear, positively homogeneous, convex functions.
Borozan, Valentin, Cornuejols, Gerard
openaire   +1 more source

Valid Inequalities for the Lasdon-Terjung Production Model

The Journal of the Operational Research Society, 1992
Summary: We consider a very simple integer program involving production of a single item and start-up costs for the standard machines first studied by Lasdon and Terjung. Solving directly as an integer program leads to prohibitively large branch and bound trees.
Vanderbeck, François, Wolsey, Laurence A.   +1 more
openaire   +2 more sources

Other Valid Inequalities and Facets

1997
We describe in this chapter the other main known classes of valid inequalities defining facets of the cut polytope. The complete linear description of the cut polytope CUT n □ is known only for n ≤ 7; it is presented in Section 30.6.
Michel Marie Deza, Monique Laurent
openaire   +1 more source

Valid Inequalities for Structured Integer Programs

2014
In Chaps. 5 and 6 we have introduced several classes of valid inequalities that can be used to strengthen integer programming formulations in a cutting plane scheme. All these valid inequalities are “general purpose,” in the sense that their derivation does not take into consideration the structure of the specific problem at hand. Many integer programs
Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli   +2 more
openaire   +1 more source

Operations on Valid Inequalities and Facets

1997
In this chapter we present several operations on valid inequalities and facets of the cut polytope. One of the basic properties of the cut polytope CUT n □ is that all its facets can be deduced from the facets of the cut cone CUT n using the so-called switching operation (cf. Section 26.3.2).
Michel Marie Deza, Monique Laurent
openaire   +1 more source

Integer Programs and Valid Inequalities for Planning Problems

2000
Part of the recent work in AI planning is concerned with the development of algorithms that regard planning as a combinatorial search problem. The underlying representation language is basically propositional logic. While this is adequate for many domains, it is not clear if it remains so for problems that involve numerical constraints, or optimization
Bockmayr, Alexander, Dimopoulos, Yannis
openaire   +2 more sources

Valid inequalities for concave piecewise linear regression

Operations Research Letters, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gopalswamy, Karthick, Fathi, Yahya, Uzsoy, Reha   +2 more
openaire   +2 more sources

On validity conditions for the Poincaré inequality

Journal of Mathematical Sciences, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nazarov, A. I., Poborchi, S. V.
openaire   +2 more sources