✦ LIBER ✦

The problem of finding a subset of vectors with the maximum total weight

✍ Scribed by A. E. Baburin; E. Kh. Gimadi; N. I. Glebov; A. V. Pyatkin

Book ID: 111471153
Publisher: Pleiades Publishing
Year: 2008
Tongue: English
Weight: 528 KB
Volume: 2
Category: Article
ISSN: 1990-4789
DOI: 10.1134/s1990478908010043

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On complexity of a choice problem of the

On complexity of a choice problem of the vector subset with the maximum sum length

✍ A. V. Pyatkin 📂 Article 📅 2010 🏛 Pleiades Publishing 🌐 English ⚖ 403 KB

Analysis of maximum total return in the

Analysis of maximum total return in the continuous knapsack problem with fuzzy object weights

✍ Shih-Pin Chen 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 200 KB

On a version of the problem of choosing

On a version of the problem of choosing a vector subset

✍ A. V. Kel’manov; A. V. Pyatkin 📂 Article 📅 2009 🏛 Pleiades Publishing 🌐 English ⚖ 528 KB

On the complexity of finding a local max

On the complexity of finding a local maximum of functions on discrete planar subsets

✍ Anton Mityagin 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 237 KB

We study how many values of an unknown integer-valued function f one needs to know in order to ÿnd a local maximum of f. We consider functions deÿned on ÿnite subsets of discrete plane. We prove upper bounds for functions deÿned on rectangles and present lower bounds for functions deÿned on arbitrar

Finding a complete matching with the max

Finding a complete matching with the maximum product on weighted bipartite graphs

✍ Frank S.C. Tseng; Wei-Pang Yang; Arbee L.P. Chen 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 352 KB

A combinatorial problem in the class of

A combinatorial problem in the class of binary vectors of given weight

✍ A. A. Levitskaya 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 67 KB