Integer programming (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Integer programming" in English language version.

refsWebsite
Global rank English rank
2nd place
2nd place
5th place
5th place
11th place
8th place
69th place
59th place
149th place
178th place
102nd place
76th place
low place
9,066th place
9,203rd place
low place
6,572nd place
4,351st place
1st place
1st place
1,349th place
866th place
low place
low place
2,161st place
2,535th place
26th place
20th place
207th place
136th place
451st place
277th place
1,185th place
840th place
low place
low place

acm.org

dl.acm.org

ams.org

mathscinet.ams.org

arxiv.org

  • Bast, Hannah; Brosi, Patrick; Storandt, Sabine (2017-10-05). "Efficient Generation of Geographically Accurate Transit Maps". arXiv:1710.02226 [cs.CG].
  • Amenta, Nina; De Loera, Jesús A.; Soberón, Pablo (2017). "Helly's theorem: new variations and applications". In Harrington, Heather A.; Omar, Mohamed; Wright, Matthew (eds.). Proceedings of the AMS Special Session on Algebraic and Geometric Methods in Applied Discrete Mathematics held in San Antonio, TX, January 11, 2015. Contemporary Mathematics. Vol. 685. Providence, Rhode Island: American Mathematical Society. pp. 55–95. arXiv:1508.07606. doi:10.1090/conm/685. ISBN 9781470423216. MR 3625571.
  • Reis, Victor; Rothvoss, Thomas (2023-03-26). "The Subspace Flatness Conjecture and Faster Integer Programming".
  • Koutecký, Martin; Levin, Asaf; Onn, Shmuel (2018). "A parameterized strongly polynomial algorithm for block structured integer programs". In Chatzigiannakis, Ioannis; Kaklamanis, Christos; Marx, Dániel; Sannella, Donald (eds.). 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9–13, 2018, Prague, Czech Republic. LIPIcs. Vol. 107. Schloss Dagstuhl – Leibniz-Zentrum für Informatik. pp. 85:1–85:14. arXiv:1802.05859. doi:10.4230/LIPICS.ICALP.2018.85.

cwi.nl

homepages.cwi.nl

doi.org

handle.net

hdl.handle.net

illinois.edu

courses.engr.illinois.edu

informs.org

pubsonline.informs.org

jstor.org

mcmaster.ca

macc.mcmaster.ca

psu.edu

citeseerx.ist.psu.edu

sciencedirect.com

semanticscholar.org

api.semanticscholar.org

slideshare.net

uoa.gr

cgi.di.uoa.gr

  • Karp, Richard M. (1972). "Reducibility among Combinatorial Problems" (PDF). In R. E. Miller; J. W. Thatcher; J.D. Bohlinger (eds.). Complexity of Computer Computations. New York: Plenum. pp. 85–103. doi:10.1007/978-1-4684-2001-2_9. ISBN 978-1-4684-2003-6.

web.archive.org

worldcat.org

zib.de