Solving Large-Scale Matching Problems. - David L. Applegate; William J. Cook (Network Flows And Matching, 1991)

Sampling and Integration of Near Log-Concave functions - David L. Applegate; Ravi Kannan (STOC, 1991)

A Computational Study of the Job-Shop Scheduling Problem. - David L. Applegate; William J. Cook (INFORMS J. Comput., 1991)

Integral infeasibility and testing total dual integrality. - David L. Applegate; William J. Cook; S. Thomas McCormick (Oper. Res. Lett., 1991)

The Distribution of 3x+1 Trees. - David L. Applegate; Jeffrey C. Lagarias (Exp. Math., 1995)

Cutting planes and the traveling salesman problem (abstract only). - David L. Applegate; Robert E. Bixby; Vasek Chvátal; William J. Cook (SODA, 2000)

TSP Cuts Which Do Not Conform to the Template Paradigm. - David L. Applegate; Robert E. Bixby; Vasek Chvátal; William J. Cook (Computational Combinatorial Optimization, 2001)

Shannon capacity of frequency-overlapped digital subscriber loop channels. - Ranjan V. Sonalkar; David L. Applegate (ICC, 2002)

Solution of a Min-Max Vehicle Routing Problem. - David L. Applegate; William J. Cook; Sanjeeb Dash; André Rohe (INFORMS J. Comput., 2002)

The Cutting-Stock Approach to Bin Packing: Theory and Experiments. - David L. Applegate; Luciana S. Buriol; Bernard L. Dillard; David S. Johnson 001; Peter W. Shor (ALENEX, 2003)

Load optimal MPLS routing with N+M labels. - David L. Applegate; Mikkel Thorup (INFOCOM, 2003)

Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs. - David L. Applegate; Edith Cohen (SIGCOMM, 2003)

Chained Lin-Kernighan for Large Traveling Salesman Problems. - David L. Applegate; William J. Cook; André Rohe (INFORMS J. Comput., 2003)

Lower bounds for the total stopping time of 3x + 1 iterates. - David L. Applegate; Jeffrey C. Lagarias (Math. Comput., 2003)

Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems. - David L. Applegate; Robert E. Bixby; Vasek Chvátal; William J. Cook (Math. Program., 2003)

Coping with network failures: routing strategies for optimal demand oblivious restoration. - David L. Applegate; Lee Breslau; Edith Cohen (SIGMETRICS, 2004)

Making routing robust to changing traffic demands: algorithms and evaluation. - David L. Applegate; Edith Cohen (IEEE/ACM Trans. Netw., 2006)

Compressing rectilinear pictures and minimizing access control lists. - David L. Applegate; Gruia Calinescu; David S. Johnson 001; Howard J. Karloff; Katrina Ligett; Jia Wang (SODA, 2007)

Exact solutions to linear programming problems. - David L. Applegate; William J. Cook; Sanjeeb Dash; Daniel G. Espinoza (Oper. Res. Lett., 2007)

Problem 11286. - Marc LeBrun; David L. Applegate; Neil J. A. Sloane (Am. Math. Mon., 2007)

Descending Dungeons and Iterated Base-Changing. - David L. Applegate; Marc LeBrun; Neil J. A. Sloane (The Mathematics of Preference, Choice and Order, 2009)

Certification of an optimal TSP tour through 85, 900 cities. - David L. Applegate; Robert E. Bixby; Vasek Chvátal; William J. Cook; Daniel G. Espinoza; Marcos Goycoolea; Keld Helsgaun (Oper. Res. Lett., 2009)

Unsupervised clustering of multidimensional distributions using earth mover distance. - David L. Applegate; Tamraparni Dasu; Shankar Krishnan; Simon Urbanek (KDD, 2011)

Science in times of crisis: delivering situational awareness to emergency managers and the public when disaster strikes. - David L. Applegate (COM.Geo, 2012)

Computational Television Advertising. - Suhrid Balakrishnan; Sumit Chopra; David L. Applegate; Simon Urbanek (ICDM, 2012)

Leveraging Video Viewing Patterns for Optimal Content Placement. - Kyung-Wook Hwang; David L. Applegate; Aaron Archer; Vijay Gopalakrishnan; Seungjoon Lee; Vishal Misra; K. K. Ramakrishnan; Deborah F. Swayne (Networking (2), 2012)

Combining Predictors for Recommending Music: the False Positives' approach to KDD Cup track 2. - Suhrid Balakrishnan; Rensheng Wang; Carlos Eduardo Scheidegger; Angus MacLellan; Yifan Hu 001; Aaron Archer; Shankar Krishnan; David L. Applegate; Guangqin Ma; S. Tom Au (KDD Cup, 2012)

Content Placement via the Exponential Potential Function Method. - David L. Applegate; Aaron Archer; Vijay Gopalakrishnan; Seungjoon Lee; K. K. Ramakrishnan (IPCO, 2013)

The Yellowstone Permutation. - David L. Applegate; Hans Havermann; Robert G. Selcoe; Vladimir Shevelev; Neil J. A. Sloane; Reinhard Zumkeller (J. Integer Seq., 2015)

Quantifying the service performance impact of self-organizing network actions. - Swati Roy; David L. Applegate; Zihui Ge; Ajay Mahimkar; Shomik Pathak; Sarat C. Puthenpura (CNSM, 2016)

Toward High-Performance and Scalable Network Functions Virtualization. - Chengwei Wang; Oliver Spatscheck; Vijay Gopalakrishnan; Yang Xu; David L. Applegate (IEEE Internet Comput., 2016)

Optimal Content Placement for a Large-Scale VoD System. - David L. Applegate; Aaron Archer; Vijay Gopalakrishnan; Seungjoon Lee; K. K. Ramakrishnan (IEEE/ACM Trans. Netw., 2016)

Analysis of the Gift Exchange Problem. - Moa Apagodu; David L. Applegate; Neil J. A. Sloane; Doron Zeilberger (Electron. J. Comb., 2017)

Wireless coverage prediction via parametric shortest paths. - David L. Applegate; Aaron Archer; David S. Johnson 001; Evdokia Nikolova; Mikkel Thorup; Ger Yang (MobiHoc, 2018)

Practical Large-Scale Linear Programming using Primal-Dual Hybrid Gradient. - David L. Applegate; Mateo Díaz; Oliver Hinder; Haihao Lu; Miles Lubin; Brendan O'Donoghue; Warren Schudy (NeurIPS, 2021)

Faster first-order primal-dual methods for linear programming using restarts and sharpness. - David L. Applegate; Oliver Hinder; Haihao Lu; Miles Lubin (Math. Program., 2023)

Infeasibility Detection with Primal-Dual Hybrid Gradient for Large-Scale Linear Programming. - David L. Applegate; Mateo Díaz; Haihao Lu; Miles Lubin (SIAM J. Optim., 2024)