| 145 | -- | 150 | Egon Balas, Alan J. Hoffman, S. Thomas McCormick. A Special Issue in Memory of George B. Dantzig |
| 151 | -- | 158 | Philip E. Gill, Walter Murray, Michael A. Saunders, John A. Tomlin, Margaret H. Wright. George B. Dantzig and systems optimization |
| 159 | -- | 167 | Kenneth J. Arrow. George Dantzig in the development of economic analysis |
| 168 | -- | 173 | Martin Grötschel, George L. Nemhauser. George Dantzig s contributions to integer programming |
| 174 | -- | 185 | Richard M. Karp. George Dantzig s impact on the theory of computation |
| 186 | -- | 204 | Pierre Bonami, Lorenz T. Biegler, Andrew R. Conn, Gérard Cornuéjols, Ignacio E. Grossmann, Carl D. Laird, Jon Lee, Andrea Lodi, François Margot, Nicolas W. Sawaya, Andreas Wächter. An algorithmic framework for convex mixed integer nonlinear programs |
| 205 | -- | 219 | Mourad Baïou, Francisco Barahona. On the p-median polytope of Y-free graphs |
| 220 | -- | 230 | Adam N. Letchford, Nicholas A. Pearson. Exploiting planarity in separation routines for the symmetric traveling salesman problem |
| 231 | -- | 241 | Jesús A. De Loera, Raymond Hemmecke, Shmuel Onn, Robert Weismantel. N-fold integer programming |
| 242 | -- | 253 | Rainer E. Burkard, Carmen Pleschiutschnig, Jianzhong Zhang. The inverse 1-median problem on a cycle |
| 254 | -- | 261 | Todd Easton, Kevin Hooker. Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes |
| 262 | -- | 269 | Matteo Fischetti, Michele Monaci. How tight is the corner relaxation? |
| 270 | -- | 289 | Hanif D. Sherali, Fred Glover. Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities |
| 290 | -- | 292 | Kathie Cameron, Jack Edmonds. The travelling preacher, projection, and a lower bound for the stability number of a graph |
| 293 | -- | 313 | Matthias Köppe, Quentin Louveaux, Robert Weismantel. Intermediate integer programming representations using value disjunctions |
| 314 | -- | 322 | Esther M. Arkin, Refael Hassin. The k-path tree matroid and its applications to survivable network design |
| 323 | -- | 327 | Noga Alon, Eli Berger. The Grothendieck constant of random and pseudo-random graphs |
| 328 | -- | 336 | Oktay Günlük. A pricing problem under Monge property |
| 337 | -- | 349 | Robert G. Bland, Brenda L. Dietrich. A unified interpretation of several combinatorial dualities |
| 350 | -- | 372 | Maria Teresa Godinho, Luis Gouveia, Thomas L. Magnanti. Combined route capacity and route length models for unit demand vehicle routing problems |
| 373 | -- | 388 | Christoph Buchheim, Markus Chimani, Dietmar Ebner, Carsten Gutwenger, Michael Jünger, Gunnar W. Klau, Petra Mutzel, René Weiskircher. A branch-and-cut approach to the crossing number problem |
| 389 | -- | 414 | Daniel Bienstock, Nuri Özbay. Computing robust basestock levels |
| 415 | -- | 433 | Alper Atamtürk, Deepak Rajan. Partition inequalities for capacitated survivable network design based on directed p-cycles |
| 434 | -- | 456 | Hideki Hashimoto, Mutsunori Yagiura, Toshihide Ibaraki. An iterated local search algorithm for the time-dependent vehicle routing problem with time windows |
| 457 | -- | 466 | Uriel G. Rothblum, Jay Sethuraman. Stochastic scheduling in an in-forest |
| 467 | -- | 488 | Juan Pablo Vielma, Ahmet B. Keha, George L. Nemhauser. Nonconvex, lower semicontinuous piecewise linear optimization |
| 489 | -- | 500 | Ulrich Faigle, Britta Peis. Note on pseudolattices, lattices and submodular linear programs |
| 501 | -- | 529 | Endre Boros, Peter L. Hammer, Richard Sun, Gabriel Tavares. A max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO) |
| 530 | -- | 540 | Marcia Fampa, Kurt M. Anstreicher. An improved algorithm for computing Steiner minimal trees in Euclidean d-space |
| 541 | -- | 549 | Brady Hunsaker, Ellis L. Johnson, Craig A. Tovey. Polarity and the complexity of the shooting experiment |
| 550 | -- | 561 | James B. Orlin, Andreas S. Schulz, Sudipta Sengupta. epsilon-optimization schemes and L-bit precision: Alternative perspectives for solving combinatorial optimization problems |