Sciweavers

Share
TIT
2010
107views Education» more  TIT 2010»
8 years 8 months ago
Information inequalities for joint distributions, with interpretations and applications
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...
Mokshay M. Madiman, Prasad Tetali
ENDM
2010
118views more  ENDM 2010»
8 years 8 months ago
On the Vehicle Routing Problem with lower bound capacities
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 ...
Luís Gouveia, Juan José Salazar Gonz...
NETWORKS
2011
8 years 8 months ago
On cut-based inequalities for capacitated network design polyhedra
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...
Christian Raack, Arie M. C. A. Koster, Sebastian O...
MP
2011
8 years 8 months ago
On the relative strength of split, triangle and quadrilateral cuts
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...
Amitabh Basu, Pierre Bonami, Gérard Cornu&e...
CDC
2010
IEEE
154views Control Systems» more  CDC 2010»
8 years 8 months ago
Concentration of measure inequalities for compressive Toeplitz matrices with applications to detection and system identification
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...
Borhan Molazem Sanandaji, Tyrone L. Vincent, Micha...
IFIP
2009
Springer
8 years 11 months ago
Finite Models in FOL-Based Crypto-Protocol Verification
Cryptographic protocols can only be secure under certain inequality assumptions. Axiomatizing these inequalities explicitly is problematic: stating too many inequalities may impair...
Jan Jürjens, Tjark Weber
MP
2010
116views more  MP 2010»
8 years 12 months ago
Separation algorithms for 0-1 knapsack polytopes
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...
Konstantinos Kaparis, Adam N. Letchford
MP
2010
103views more  MP 2010»
8 years 12 months ago
Relations between facets of low- and high-dimensional group problems
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...
Santanu S. Dey, Jean-Philippe P. Richard
MOR
2010
111views more  MOR 2010»
8 years 12 months ago
Generalized Domino-Parity Inequalities for the Symmetric Traveling Salesman Problem
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....
William J. Cook, Daniel G. Espinoza, Marcos Goycoo...
NA
2007
98views more  NA 2007»
9 years 1 months ago
Conjectured inequalities for Jacobi polynomials and their largest zeros
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...
Walter Gautschi, Paul Leopardi
books