Difference between revisions of "CSE550 Combinatorial Algorithms/Intractability"
From esoterum.org
| Line 6: | Line 6: | ||
*[http://mat.gsia.cmu.edu/orclass/integer/integer.html Integer Linear Programming Tutorial] | *[http://mat.gsia.cmu.edu/orclass/integer/integer.html Integer Linear Programming Tutorial] | ||
*[http://wpweb2.tepper.cmu.edu/fmargot/introILP.html Interger Linear Programming Tutorial] (CMU) | *[http://wpweb2.tepper.cmu.edu/fmargot/introILP.html Interger Linear Programming Tutorial] (CMU) | ||
| + | *[http://elib.zib.de/pub/Packages/mathprog/ Opensource Algorithm Code], Zuse Institute | ||
== HW 6 == | == HW 6 == | ||
Revision as of 00:37, 19 November 2007
Resources
- -Unimodularity ensures that the solution to an LP will always be integer if all of the costs and constraints are also integer
- Linear Programming animation (simplex method)
- List of LP solvers (including NEOS)
- Integer Linear Programming Tutorial
- Interger Linear Programming Tutorial (CMU)
- Opensource Algorithm Code, Zuse Institute
HW 6
- 1. 2-SAT is in NP
- 2. A sub-optimal solution to TSP is a Hamiltonian Cycle.
- 3. 3SAT reduction to NAESAT
- 4. Finding disjoint paths with different path-costs: Complexity and algorithms
- Randeep Bhatia · Murali Kodialam · T. V. Lakshman, "Finding disjoint paths with related path costs", Springer Science+Business Media, LLC 2006
Midterm
Q1
- Bin Zhang, Julie Ward, Qi Feng, "Simultaneous Parametric Maximum Flow Algorithm with Vertex Balancing", HP Laboratories Palo Alto, June 28, 2005
- J. M. W. Rhys, "A Selection Problem of Shared Fixed Costs and Network Flows", Management Science, Vol. 17, No. 3, Theory Series (Nov., 1970), pp. 200-207
