blob: 20c16ffe585fcb803ebe5ef31fecc35610f2d3e2 [file] [log] [blame]
@techreport{NicosChristofides1976TSP-FiftyPercent,
Author="Nicos Christofides",
Title="Worst-Case Analysis of a New Heuristic for the Traveling Salesman Problem",
month="February",
year="1976",
note="Technical Report 388",
institution="Graduate School of Industrial Administration, Carnegie-Mellon University",
}
@article{Martin:1992:LMC:2307953.2308141,
author = {Martin, Olivier and Otto, Steve W and Felten, Edward W},
title = {Large-step Markov Chains for the TSP Incorporating Local Search Heuristics},
journal = {Oper. Res. Lett.},
issue_date = {May, 1992},
volume = {11},
number = {4},
month = may,
year = {1992},
issn = {0167-6377},
pages = {219--224},
numpages = {6},
url = {http://dx.doi.org/10.1016/0167-6377(92)90028-2},
doi = {10.1016/0167-6377(92)90028-2},
acmid = {2308141},
publisher = {Elsevier Science Publishers B. V.},
address = {Amsterdam, The Netherlands, The Netherlands},
keywords = {Markov, TSP, optimization, simulated annealing},
}
@article{ManindraAgrawal2004PrimesIsInP,
author = "Manindra Agrawal and Neeraj Kayal and Nitin Saxena",
title = "{PRIMES} is in {P}",
journal = {Annals of Mathematics},
issue_date = {September 2004},
volume = {160},
number = {2},
month = "September",
year = {2004},
pages = {781--793},
url = {http://www.cse.iitk.ac.in/users/manindra/algebra/primality_v6.pdf},
doi = {10.4007/annals.2004.160.781},
publisher = {Princeton University \& Institute for Advanced Study},
address = {Princeton, NJ, USA},
}
@inproceedings{Zhang:2002:QEB:647771.734434,
author = {Zhang, Lintao and Malik, Sharad},
title = {The Quest for Efficient Boolean Satisfiability Solvers},
booktitle = {Proceedings of the 14th International Conference on Computer Aided Verification},
series = {CAV '02},
year = {2002},
isbn = {3-540-43997-8},
pages = {17--36},
numpages = {20},
url = {http://dl.acm.org/citation.cfm?id=647771.734434},
acmid = {734434},
publisher = {Springer-Verlag},
address = {London, UK, UK},
}
@book{DLApplegate2007TSPtextbook,
author="David L. Applegate and Robert M. Bixby and Vasek Chv\'{a}tal and William J. Cook",
title="The Traveling Salesman Problem",
year="2007",
publisher="Princeton University Press",
isbn="9780691129938",
}
@unpublished{SharadMalik2010SATSolverHistory,
Author="Sharad Malik",
Title="{SAT} Solvers: A Condensed History",
month="March",
day="1",
year="2010",
note="\url{http://www.cs.princeton.edu/courses/archive/spring10/cos598D/SharadMalikCOS598d.pdf}",
}
@unpublished{SATCompetition2002,
Author="Hans van Maaren and John Franco",
Title="{SAT} Competitions",
year="2002-",
note="\url{http://www.satcompetition.org/}",
}
@book{vanHarmelen:2007:HKR:1557461,
author = {van Harmelen, Frank and van Harmelen, Frank and Lifschitz, Vladimir and Porter, Bruce},
title = {Handbook of Knowledge Representation},
year = {2007},
isbn = {0444522115, 9780444522115},
publisher = {Elsevier Science},
address = {San Diego, USA},
}
@techreport{ShaiHaim2009SAT-MachineLearning,
Author="Shai Haim and Toby Walsh",
Title="Restart Strategy Selection using Machine Learning Techniques",
month="July",
day="29",
year="2009",
institution="Cornell University Library",
note="\url{https://arxiv.org/pdf/0907.5032v1.pdf}",
}
@article{Malik:2009:BST:1536616.1536637,
author = {Malik, Sharad and Zhang, Lintao},
title = {Boolean Satisfiability from Theoretical Hardness to Practical Success},
journal = {Commun. ACM},
issue_date = {August 2009},
volume = {52},
number = {8},
month = aug,
year = {2009},
issn = {0001-0782},
pages = {76--82},
numpages = {7},
url = {http://doi.acm.org/10.1145/1536616.1536637},
doi = {10.1145/1536616.1536637},
acmid = {1536637},
publisher = {ACM},
address = {New York, NY, USA},
}
@inproceedings{Audemard:2009:PLC:1661445.1661509,
author = {Audemard, Gilles and Simon, Laurent},
title = {Predicting Learnt Clauses Quality in Modern SAT Solvers},
booktitle = {Proceedings of the 21st International Jont Conference on Artifical Intelligence},
series = {IJCAI'09},
year = {2009},
location = {Pasadena, California, USA},
pages = {399--404},
numpages = {6},
url = {http://dl.acm.org/citation.cfm?id=1661445.1661509},
acmid = {1661509},
publisher = {Morgan Kaufmann Publishers Inc.},
address = {San Francisco, CA, USA},
}
@inproceedings{JamesEzick2014ExtremeSAT,
author = "James Ezick and Jonathan Springer and Tom Henretty and Chanseok Oh",
title = "Extreme SAT-based Constraint Solving with R-Solve",
booktitle = {Proceedings of the IEEE High Performance Extreme Computing Conference},
month = {September},
year = {2014},
pages = {},
publisher = {IEEE},
address = {Waltham, MA, USA},
url={http://www.ieee-hpec.org/2014/CD/index_htm_files/FinalPapers/112.pdf},
}
@article{Sebo:2014:STN:2688265.2688281,
author = {Seb\H{o}, Andr\'{a}s and Vygen, Jens},
title = {Shorter Tours by Nicer Ears: 7/5-Approximation for the graph-TSP, 3/2 for the Path Version, and 4/3 for Two-edge-connected Subgraphs},
journal = {Combinatorica},
issue_date = {October 2014},
volume = {34},
number = {5},
month = oct,
year = {2014},
issn = {0209-9683},
pages = {597--629},
numpages = {33},
url = {http://dx.doi.org/10.1007/s00493-014-2960-3},
doi = {10.1007/s00493-014-2960-3},
acmid = {2688281},
publisher = {Springer-Verlag New York, Inc.},
address = {Secaucus, NJ, USA},
keywords = {05C85, 68R10, 90C27},
}
@unpublished{WikipediaPrimalityTest,
Author="{Wikipedia Contributors}",
Title="{Primality test}",
month="February",
day="15",
year="2017",
note="\url{https://en.wikipedia.org/wiki/Primality_test}",
}
@unpublished{WikipediaAKSPrimalityTest,
Author="{Wikipedia Contributors}",
Title="{AKS primality test}",
month="February",
day="21",
year="2017",
note="\url{https://en.wikipedia.org/wiki/AKS_primality_test}",
}
@unpublished{WikipediaTSP,
Author="{Wikipedia Contributors}",
Title="{Traveling salesman problem}",
month="March",
day="13",
year="2017",
note="\url{https://en.wikipedia.org/wiki/Travelling_salesman_problem}",
}
@unpublished{WikipediaIntegerFactorization,
Author="{Wikipedia Contributors}",
Title="{Integer factorization}",
month="March",
day="13",
year="2017",
note="\url{https://en.wikipedia.org/wiki/Integer_factorization}",
}