|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'504'928
Articles rated: 2609
25 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
A Branch-and-Cut Strategy for the Manickam-Miklos-Singhi Conjecture | | Stephen G. Hartke
; Derrick Stolee
; | | Date: |
14 Feb 2013 | | Abstract: | The Manickam-Miklos-Singhi Conjecture states that when n is at least 4k,
every multiset of n real numbers with nonnegative total sum has at least (n-1
choose k-1) k-subsets with nonnegative sum. We develop a branch-and-cut
strategy using a linear programming formulation to show that verifying the
conjecture for fixed values of k is a finite problem. To improve our search, we
develop a zero-error randomized propagation algorithm. Using implementations of
these algorithms, we verify a stronger form of the conjecture for all k at most
seven. | | Source: | arXiv, 1302.3636 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER