Revision as of 23:36, 24 March 2008 edit David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,660 edits m →References: fix young ref ← Previous edit		Revision as of 23:37, 24 March 2008 edit undo David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,660 edits m →References: young pages Next edit →
Line 47: * {{citation \| title=The relaxation method for linear inequalities \| last=Motzkin \| first=TS \| coauthors=IJ Schoenberg \| journal=Canadian Journal of Mathematics \| year=1954 \| volume=6 \| pages=393-404}}. * {{citation \| title= Randomized rounding: A technique for provably good algorithms and algorithmic proofs\|first1=Prabhakar\|last1=Raghavan\|first2=Clark D. \|last2=Tompson\|journal=Combinatorica\|volume=7\|issue=4\|year=1987\|pages=365–374\|doi=10.1007/BF02579324}}. * {{citation \| contribution = Randomized rounding without solving the linear program \| first = Neal E. \| last = Young \| title = Proc. 6th ACM-SIAM Symp. Discrete Algorithms (SODA) \| year = 1995 \| url = http://portal.acm.org/citation.cfm?id=313689 \| pages = 170–178}}. [[Category:Optimization]]

Linear programming relaxation: Difference between revisions