# Complexity results for classical OR problems

 7 1 I'm looking for [concise, yet comprehensive] online resources and/or (state of the art) survey papers presenting complexity results for classical OR problems such as Shortest Path and Spanning Tree Problems; Network Flow, Assignment and Knapsack Problems; Traveling Salesman and Vehicle Routing Problems; ... (and their respective variants). By "complexity results", both problem-specific lower bounds (resp., complexity classes) as well as performance of seminal algorithms (optimal, approximative) should be addressed. For instance, the Scheduling Zoo is a nice searchable bibliography on results w.r.t. scheduling problems (though, it does not offer detailed statements in terms of Big-$$O$$-assessments). Collected web resources: Assignment Problems Quadratic Assignment Problem Network Flow Problems Scheduling Problems PS: This is a "community question". Feel free to edit as needed. (That is, if you have at least 30 "karma points".) This question is marked "community wiki". asked 29 Sep '10, 19:47 fbahr ♦ 4.3k●5●15 accept rate: 12%

 2 This one is a classic resource for NP-hard problems: http://www.csc.kth.se/~viggo/wwwcompendium/. Unfortunately, it does not seem to get updated any more, but there are probably too many results out there to keep track. link This answer is marked "community wiki". answered 30 Sep '10, 08:32 tim 1●1 accept rate: 0%
 1 Here is a very useful Library for the Quadratic Assignment Problem http://www.seas.upenn.edu/qaplib/ Here You can find papers , solvers, solutions... link This answer is marked "community wiki". answered 30 Sep '10, 12:20 Buxley 544●4●13 accept rate: 9% Ehsan ♦ 4.0k●1●9●19
 toggle preview community wiki

By Email:

Markdown Basics

• *italic* or _italic_
• **bold** or __bold__
• image?![alt text](/path/img.jpg "Title")
• numbered list: 1. Foo 2. Bar
• to add a line break simply add two spaces to where you would like the new line to be.
• basic HTML tags are also supported

Tags: