CSE550 Combinatorial Algorithms/Intractability: Difference between revisions
From esoterum.org
Jump to navigationJump to search
No edit summary |
No edit summary |
||
| Line 8: | Line 8: | ||
=== Q1 === | === Q1 === | ||
*Bin Zhang, Julie Ward, Qi Feng, [http://www.hpl.hp.com/techreports/2005/HPL-2005-121.pdf "Simultaneous Parametric Maximum Flow Algorithm with Vertex Balancing"], HP Laboratories Palo Alto, June 28, 2005 | *Bin Zhang, Julie Ward, Qi Feng, [http://www.hpl.hp.com/techreports/2005/HPL-2005-121.pdf "Simultaneous Parametric Maximum Flow Algorithm with Vertex Balancing"], HP Laboratories Palo Alto, June 28, 2005 | ||
* | |||
J. M. W. Rhys, [http://links.jstor.org/sici?sici=0025-1909(197011)17%3A3%3C200%3AASPOSF%3E2.0.CO%3B2-6 "A Selection Problem of Shared Fixed Costs and Network Flows"], Management Science, Vol. 17, No. 3, Theory Series (Nov., 1970), pp. 200-207 | |||
Revision as of 01:50, 22 October 2007
- Linear Programming Introduction
- Linear Programming animation (simplex method)
- List of LP solvers (including NEOS)
- Integer Linear Programming Tutorial
- Interger Linear Programming Tutorial (CMU)
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
