Difference between revisions of "CSE550 Combinatorial Algorithms/Intractability"
From esoterum.org
| Line 9: | Line 9: | ||
:2. A sub-optimal solution to TSP is a Hamiltonian Cycle. | :2. A sub-optimal solution to TSP is a Hamiltonian Cycle. | ||
| + | :4. Finding disjoint paths with different path-costs: Complexity and algorithms | ||
Revision as of 23:28, 12 November 2007
- Linear Programming Introduction
- Linear Programming animation (simplex method)
- List of LP solvers (including NEOS)
- Integer Linear Programming Tutorial
- Interger Linear Programming Tutorial (CMU)
HW 6
- 1. 2-SAT is in NP
- 2. A sub-optimal solution to TSP is a Hamiltonian Cycle.
- 4. Finding disjoint paths with different path-costs: Complexity and algorithms
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
