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"
Bookmarks inbookmarks:mine
inbookmarks:1234
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
Search options answers only user 354

For questions asking for references from the literature or textbooks on specific topics.

14
votes
I believe there are long answers to this question, but a very short one is: yes. Here is an example that originated not from the use case you describe, but I believe that they can directly apply their …
answered Jan 7 '20 by Marco Lübbecke
14
votes
I love this historic piece by Alexander Schrijver about max flow and min cut (DOI link).
answered Jun 12 '19 by Marco Lübbecke
15
votes
I am not sure whether you are looking for polynomial optimization like Introduction to concepts and advances in polynomial optimization by Martin Mevissen, or polynomial optimization by Hoang Tuy?
answered Jul 11 '19 by Marco Lübbecke
13
votes
First of all, I would say that "fast solvable in practice" is possible also when your remaining problem still is NP-hard. But since you ask specifically for polytime solvability, there are some cases. …
answered Jun 9 '20 by Marco Lübbecke
7
votes
I waited some time but apparently no easy answer here. Thanks for providing some more hints in the comments to your question. One specialty about the knapsack book is: it is a monograph, that is, writ …
answered Nov 4 '19 by Marco Lübbecke