✦ LIBER ✦

On Certain Combinatorial Problems

✍ Scribed by Rosenstock, Herbert B.

Book ID: 111897058
Publisher: American Institute of Physics
Year: 1962
Tongue: English
Weight: 351 KB
Volume: 30
Category: Article
ISSN: 0002-9505
DOI: 10.1119/1.1942015

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the convex hull of feasible solutions

On the convex hull of feasible solutions to certain combinatorial problems

✍ Maurice Queyranne; Yaoguang Wang 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 767 KB

Automatic solution of a certain class of

Automatic solution of a certain class of combinatorial problems

✍ Jacques Cohen; Joel Katcoff 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 468 KB

On a measure of quasistability of a cert

On a measure of quasistability of a certain vector linearly combinatorial Boolean problem

✍ V. A. Emelichev; A. V. Karpuk; K. G. Kuz’min 📂 Article 📅 2010 🏛 Allerton Press, Inc. 🌐 English ⚖ 520 KB

Two combinatorial problems on posets

✍ Yair Caro 📂 Article 📅 1996 🏛 Springer Netherlands 🌐 English ⚖ 367 KB

Bialostocki proposed the following problem: Let n 2 k 2 2 be integers such that k/n. Let p(n, k) denote the least positive integer having the property that for every poset P, IPI > p(n, k) and every &coloring f: P + & there exists either a chain or an antichain A, (Al = n and xaEA f(a) = 0 (modk). E

On simple combinatorial optimization pro

On simple combinatorial optimization problems

✍ A.J. Hoffman 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 228 KB

We characterize (0,l) linear programming matrices for which a greedy algorithm and its dual solve certain covering and packing problems. Special cases are shortest path and minimum spanning tree algorithms.

A certain combinatorial inequality

✍ V. L. Dol'nikov 📂 Article 📅 1989 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 400 KB