Results 171 to 180 of about 2,766,432 (214)
Some of the next articles are maybe not open access.
New Valid Inequalities for the Two-Echelon Capacitated Vehicle Routing Problem
Electronic Notes in Discrete Mathematics, 2018Guido Perboli +2 more
exaly +2 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
Improved solutions for inventory-routing problems through valid inequalities and input ordering
International Journal of Production Economics, 2014Leandro C Coelho, Gilbert Laporte
exaly +2 more sources
Merging valid inequalities over the multiple knapsack polyhedron
International Journal of Operational Research, 2015Todd Easton
exaly +2 more sources
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
Valid Inequalities for Mixed Integer Bilevel Linear Optimization Problems
arXiv.orgDespite the success of branch-and-cut methods for solving mixed integer bilevel linear optimization problems (MIBLPs) in practice, there are still gaps in both the theory and practice surrounding these methods. In the first part of this paper, we lay out
Sahar Tahernejad, T. Ralphs
semanticscholar +1 more source
Integer Programs and Valid Inequalities for Planning Problems
2000Part 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
Alexander Bockmayr, Yannis Dimopoulos
openaire +2 more sources
Necessary and sufficient conditions for the validity of Jensen’s inequality
Archiv der Mathematik, 2013The authors established some improvements for several known results relative to the \(n\)-dimensional Jensen's inequality [\textit{J. E. McShane}, Bull. Am. Math. Soc. 43, 521--527 (1937; Zbl 0017.16003; JFM 63.0160.01)].
Guessab, A., Schmeisser, G.
openaire +2 more sources