Content deleted Content added
Citation bot (talk | contribs) m Add: series, isbn, citeseerx. | You can use this bot yourself. Report bugs here. | User-activated. |
|||
Line 71:
* {{citation | contribution=Polyhedral combinatorics: An annotated bibliography | first1 = Karen | last1 = Aardal | author1-link = Karen Aardal | first2 = Robert | last2 = Weismantel | title = Annotated Bibliographies in Combinatorial Optimization | publisher = Wiley | year = 1997 | url = http://www.cs.uu.nl/research/techreps/repo/CS-1996/1996-27.pdf}}.
* {{citation | title=The relaxation method for linear inequalities | last=Agmon | first=Shmuel | journal=Canadian Journal of Mathematics | year=1954 | volume=6 | pages=382–392 | url = http://www.math.ca/cjm/v6/p382 | doi=10.4153/CJM-1954-037-2}}.
* {{citation | title = Solution of a large-scale traveling-salesman problem | first1 = George | last1 = Dantzig | authorlink1 = George Dantzig | first2 = D. R. | last2 = Fulkerson | authorlink2 = D. R. Fulkerson | first3 = Selmer | last3 = Johnson | journal = Journal of the Operations Research Society of America | volume = 2 | issue = 4 | year = 1954 | pages = 393–410 | doi = 10.1287/opre.2.4.393}}.
* {{citation | title = A threshold of ln ''n'' for approximating set cover | journal = Journal of the ACM | year = 1998 | pages = 634–652 |volume = 45 | issue = 4 | last = Feige | first = Uriel | authorlink = Uriel Feige | doi = 10.1145/285055.285059}}.
* {{citation | first = Ralph E. | last = Gomory | authorlink = Ralph E. Gomory | title = Outline of an algorithm for integer solutions to linear programs | journal = [[Bulletin of the American Mathematical Society]] | doi = 10.1090/S0002-9904-1958-10224-4 | volume = 64 | year = 1958 | pages = 275–279 | issue = 5}}.
* {{citation | title = On the ratio of optimal integral and fractional covers | last = Lovász | first = László | authorlink = László Lovász | journal = Discrete Mathematics | volume = 13 | pages = 383–390 | year = 1975 | doi = 10.1016/0012-365X(75)90058-8 | issue = 4 }}.
* {{citation | title=The relaxation method for linear inequalities | last1=Motzkin | first1=T. S. | author1-link = Theodore Motzkin | first2=I. J. | last2 = Schoenberg | author2-link = Isaac Jacob Schoenberg | journal=Canadian Journal of Mathematics | year=1954 | volume=6 | pages=393–404 | url = http://www.math.ca/cjm/v6/p393 | doi=10.4153/CJM-1954-038-x}}.
* {{citation | title= Randomized rounding: A technique for provably good algorithms and algorithmic proofs|first1=Prabhakar|last1=Raghavan|first2=Clark D. |last2=Thompson|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:Linear programming]]
| |||