Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with cutting-planes
Search options not deleted
user 8751
3
votes
1
answer
259
views
How to redefine separation procedure to get 0-1 knapsack with odd number of items
So I have a 0-1 knapsack problem:
\begin{align}\max&\quad \sum_j c_j x_j\\
\text{s.t.}&\quad \sum_j a_j x_j \leq b\\
&\quad x_j \in \{0,1\}\end{align}
but it has an additional requirement that the num …
- 161