TIT
2010
13 years 7 months ago
2010
Upper and lower bounds are obtained for the joint entropy of a collection of random variables in terms of an arbitrary collection of subset joint entropies. These inequalities gene...
ENDM
2010
13 years 7 months ago
2010
In this paper we show and discuss a family of inequalities for solving a variant of the classical vehicle routing problem where also a lower bound is considered. The inequalities ...
NETWORKS
2011
13 years 7 months ago
2011
In this article we study capacitated network design problems. We unify and extend polyhedral results for directed, bidirected and undirected link capacity models. Based on valid i...
MP
2011
13 years 7 months ago
2011
Integer programs defined by two equations with two free integer variables and nonnegative continuous variables have three types of nontrivial facets: split, triangle or quadrilat...
CDC
2010
IEEE
13 years 7 months ago
2010
IEEE
In this paper, we derive concentration of measure inequalities for compressive Toeplitz matrices (having fewer rows than columns) with entries drawn from an independent and identic...
IFIP
2009
Springer
13 years 10 months ago
2009
Springer
Cryptographic protocols can only be secure under certain inequality assumptions. Axiomatizing these inequalities explicitly is problematic: stating too many inequalities may impair...
MP
2010
13 years 11 months ago
2010
Valid inequalities for 0-1 knapsack polytopes often prove useful when tackling hard 0-1 Linear Programming problems. To generate such inequalities, one needs separation algorithms...
MP
2010
13 years 11 months ago
2010
In this paper, we introduce an operation that creates families of facet-defining inequalities for highdimensional infinite group problems using facet-defining inequalities of l...
MOR
2010
13 years 11 months ago
2010
We extend the work of Letchford (2000) by introducing a new class of valid inequalities for the traveling salesman problem, called the generalized domino-parity (GDP) constraints....
NA
2007
13 years 12 months ago
2007
Inequalities are conjectured for the Jacobi polynomials P (α,β) n and their largest zeros. Special attention is given to the cases β = α − 1 and β = α. Key words. Jacobi po...