query: Difficult discrete optimization "knapsack" type problem
positive_passages.docid: 157298
positive_passages.text: Bags with balls - Combinatorial Optimization of Probability problem
negative_passages.docid: 41205
negative_passages.text: Help me solve a combinatorial problem
negative_passages.docid: 38059
negative_passages.text: Neyman allocation and proportional allocation
negative_passages.docid: 85832
negative_passages.text: Tough contest problem
negative_passages.docid: 37091
negative_passages.text: The Dido problem with an arclength constraint
negative_passages.docid: 5772
negative_passages.text: Graphically solving a linear programming problem
negative_passages.docid: 138304
negative_passages.text: getting tight bounds on n!
negative_passages.docid: 12291
negative_passages.text: Two envelope problem revisited
negative_passages.docid: 7944
negative_passages.text: What algorithm can be used for packing rectangles of different sizes into the smallest rectangle possible in a fairly optimal way?
negative_passages.docid: 56092
negative_passages.text: What is complexity of this max-edge subgraph problem?
negative_passages.docid: 69748
negative_passages.text: Semi-Ambiguous Combinatorics Problem
negative_passages.docid: 142886
negative_passages.text: Find set with maximal cardinality given constraints
negative_passages.docid: 64511
negative_passages.text: A weighted version of random.choice
negative_passages.docid: 145978
negative_passages.text: Python Implementations of Packing Algorithm
negative_passages.docid: 145102
negative_passages.text: Selecting A combination of minimum cost
negative_passages.docid: 102630
negative_passages.text: Approximation algorithms for min vector subset-sum over GF(2)
negative_passages.docid: 5076
negative_passages.text: Minimize Function over Convex Subset