• Minimizing Makespan in No-Wait Job Shops. Nikhil Bansal, Mohammad Mahdian, Maxim Sviridenko. 01/2004.
  • Remarks on the perfect graph and pluperfect graph theorems. Alan Hoffman. 11/2003.
  • Comparing valid inequalities for cyclic group polyhedra. Sanjeeb Dash and Oktay Günlük. 11/2003.
  • More on a parsimonious coloring formulation. Jon Lee and François Margot. 11/2003.
  • Separation of partition inequalities with terminals. Francisco Barahona and Herve Kerivin. 11/2003.
  • Strings with maximum numbers of distinct subsequences and substrings. Abraham Flaxman, Aram Harrow and Gregory Sorkin. 11/2003.
  • The satisfiability threshold of random 3-SAT is at least 3.52. Mohammad Hajiaghayi and Gregory B. Sorkin. 10/2003.
  • A masked spectral bound for maximum-entropy sampling. Kurt Anstreicher and Jon Lee. 09/2003.
  • Embracing the giant component. Abraham Flaxman, David Gamarnik and Gregory Sorkin. 09/2003.
  • Resource optimization in QoS multicast routing of real-time multimedia. Moses Charikar, Joseph Naor and Baruch Schieber. 09/2003.
  • Gersgorin variations II: On themes of Fan and Gudkov. Alan Hoffman. 09/2003.
  • Valid inequalities based on simple mixed-integer sets. Sanjeeb Dash and Oktay Günlük. 09/2003.
  • Minimizing migrations in fair multiprocessor scheduling of persistent tasks. Tracy Kimbrel, Baruch Schieber and Maxim Sviridenko. 07/2003.
  • Parsimonious binary-encoding in integer programming. Don Coppersmith and Jon Lee. 06/2003.
  • Approximately optimal control of fluid networks . Lisa Fleischer and Jay Sethuraman. 06/2003.
  • Quickest flows over time. Lisa Fleischer and Martin Skutella. 06/2003.
  • Reconstructing curves in three (and higher) dimensional space from noisy data. Don Coppersmith and Madhu Sudan. 06/2003.
  • Designing private line networks. Oktay Günlük, Beate Brockmuller and Lawrence Wolsey. 05/2003.
  • BAC: A BCP based branch-and-cut example. François Margot. 05/2003.
  • Random MAX SAT, random MAX CUT, and their phase transitions. Don Coppersmith, David Gamarnik, Mohammad Hajiaghayi and Gregory Sorkin. 04/2003.
  • An improved upper bound for the TSP in 3-connected cubic graphs . Maxim Sviridenko, David Gamarnik and Moshe Lewenstein. 03/2003.
  • Note on permutation flow shop problem. Maxim Sviridenko. 03/2003.
  • Min-up/min-down polytopes. François Margot and Jon Lee. 02/2003.
  • Implementation of an exact algorithm for a cutting-stock problem using components of COIN-OR. Laci Ladanyi, Jon Lee and Robin Lougee-Heimer. 01/2003.