Revision as of 00:24, 9 April 2011 edit Citation bot 1 (talk \| contribs) Bots 130,044 edits m [Pu334]+: issue. ← Previous edit		Revision as of 08:10, 11 September 2011 edit undo Maxal (talk \| contribs) Extended confirmed users, Pending changes reviewers 4,192 edits →References Next edit →
Line 12: == References == * {{Citation \| last1=Bruns \| first1=Winfried \| last2=Gubeladze \| first2=Joseph \| last3=Henk \| first3=Martin \| last4=Martin \| first4=Alexander \| last5=Weismantel \| first5=Robert \| title=A counterexample to an integer analogue of Carathéodory's theorem \| doi=10.1515/crll.1999.045 \| year=1999 \| journal=[[Journal für die reine und angewandte Mathematik]] \| volume=510 \| pages=179–185 \| issue=510}}. * {{Citation \| last1=Cook \| first1=William John \| last2=Fonlupt \| first2=Jean \| last3=Schrijver \| first3=Alexander \| title=An integer analogue of Carathéodory's theorem \| doi=10.1016/0095-8956(86)90064-X \| year=1986 \| journal=Journal of Combinatorial Theory. Series B \| volume=40 \| issue=1 \| pages=63–70}}. * {{Citation \| last1=Eisenbrand \| first1=Friedrich \| last2=Shmonin \| first2=Gennady \| title=Carathéodory bounds for integer cones \| doi=10.1016/j.orl.2005.09.008 \| year=2006 \| journal=Operations Research Letters \| volume=34 \| issue=5 \| pages=564–568}}. * {{cite journal \|author = D. V. Pasechnik \|title=On computing the Hilbert bases via the Elliott—MacMahon algorithm \|journal=Theoretical computer science \|volume=263 \|year=2001 \|pages=37-46 \|doi=10.1016/S0304-3975(00)00229-2}}

Hilbert basis (linear programming): Difference between revisions