✦ LIBER ✦

A Subexponential Bound for Linear Programming

✍ Scribed by Matousek, M. Sharir, E. Welzl, J.

Book ID: 120137165
Publisher: Springer
Year: 1996
Tongue: English
Weight: 129 KB
Volume: 16
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s004539900062

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A subexponential bound for linear progra

A subexponential bound for linear programming

✍ J. Matoušek, M. Sharir and E. Welzl 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 470 KB

The linear programming bound for binary

The linear programming bound for binary linear codes

✍ Brouwer, A.E. 📂 Article 📅 1993 🏛 IEEE 🌐 English ⚖ 412 KB

A linear integer programming bound for m

A linear integer programming bound for maximum-entropy sampling

✍ Jon Lee; Joy Williams 📂 Article 📅 2003 🏛 Springer-Verlag 🌐 English ⚖ 102 KB

Improved Bounds for Aggregated Linear Pr

Improved Bounds for Aggregated Linear Programs

✍ Roy Mendelssohn 📂 Article 📅 1980 🏛 INFORMS 🌐 English ⚖ 153 KB

A Finite Branch-and-Bound Algorithm for

A Finite Branch-and-Bound Algorithm for Linear Multiplicative Programming

✍ Takahito Kuno 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 118 KB

A linear programming bound for orthogona

A linear programming bound for orthogonal arrays with mixed levels

✍ N.J.A. Sloane; J. Stufken 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 451 KB

We show how the Delsarte theory can be used to obtain a linear programming bound for orthogonal arrays with mixed levels. Even for strength 2 this improves on the Rao bound in a large number of cases. The results point to several interesting sets of parameters for which the existence of the arrays i