Results 221 to 230 of about 22,543 (264)
Some of the next articles are maybe not open access.
Valid Linear Inequalities for Fixed Charge Problems
Operations Research, 1985Many problems in the Operations Research/Management Science literature can be formulated with both zero-one and continuous variables. However, the exact optimization of such mixed zero-one models remains a computational challenge. In this paper, we propose to study mixed problems from a mathematical point of view that is similar in spirit to recent ...
Manfred W. Padberg +2 more
exaly +2 more sources
Valid inequalities for concave piecewise linear regression
Operations Research Letters, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Reha Uzsoy, Yahya Fathi
exaly +3 more sources
New formulations and valid inequalities for a bilevel pricing problem
Operations Research Letters, 2008no ...
Martine Labbé +2 more
exaly +6 more sources
Minimal Valid Inequalities for Integer Constraints
Mathematics of Operations Research, 2009In 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.
Valentin Borozan, Gérard Cornuéjols
openaire +1 more source
Valid inequalities for binary linear codes
2009 IEEE International Symposium on Information Theory, 2009We 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.
Stefan Ruzika +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, 2016Rewriting 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 0001
openaire +1 more source
On validity conditions for the Poincaré inequality
Journal of Mathematical Sciences, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nazarov, A. I., Poborchi, S. V.
openaire +2 more sources