Journal: INFORMS Journal on Computing

Volume 22, Issue 1

1 -- 0John W. Chinneck. From the Editor
2 -- 17Warren B. Powell. Feature Article - Merging AI and OR to Solve High-Dimensional Stochastic Optimization Problems Using Approximate Dynamic Programming
18 -- 19John N. Tsitsiklis. Commentary - Perspectives on Stochastic Optimization Over Time
20 -- 22Andrzej Ruszczynski. Commentary - Post-Decision States and Separable Approximations Are Powerful Tools of Approximate Dynamic Programming
23 -- 25Warren B. Powell. Rejoinder - The Languages of Stochastic Optimization
26 -- 43Robert Fourer, Chandrakant Maheshwari, Arnold Neumaier, Dominique Orban, Hermann Schichl. Convexity and Concavity Detection in Computational Graphs: Tree Walks for Convexity Assessment
44 -- 58Dimitris Bertsimas, Omid Nohadani, Kwong Meng Teo. Nonconvex Robust Optimization for Problems with Constraints
59 -- 70Michel Bierlaire, M. Thémans, Nicolas Zufferey. A Heuristic for Nonlinear Global Optimization
71 -- 80Stephen E. Chick, Jürgen Branke, Christian Schmidt 0002. Sequential Sampling to Myopically Maximize the Expected Value of Information
81 -- 92Kaeyoung Shin, Raghu Pasupathy. An Algorithm for Fast Generation of Bivariate Poisson Random Vectors
93 -- 107Oliver Bastert, Benjamin Hummel, Sven de Vries. A Generalized Wedelin Heuristic for Integer Programming
108 -- 119Matteo Fischetti, Domenico Salvagnin. Pruning Moves
120 -- 130Barry McCollum, Andrea Schaerf, Ben Paechter, Paul McMullan, Rhydian Lewis, Andrew J. Parkes, Luca Di Gaspero, Rong Qu, Edmund K. Burke. Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition
131 -- 143Krzysztof C. Kiwiel. An Inexact Bundle Approach to Cutting-Stock Problems
144 -- 153Richard J. Caron, Tim Traynor, Shafiu Jibrin. Feasibility and Constraint Analysis of Sets of Linear Matrix Inequalities
154 -- 167Emilio Carrizosa, Belen Martin-Barragan, Dolores Romero Morales. Binarized Support Vector Machines
168 -- 177Christoph Buchheim, Angelika Wiegele, Lanbo Zheng. Exact Algorithms for the Quadratic Linear Ordering Problem