Access Indicators

Free Access= Free Access
Open Access = Open Access

What is Issue in Advance?

This journal follows a continuous publication model. INFORMS Issues in Advance (IiA) allows issues to be created online article-by-article. As new articles are published online, they are assigned to an issue and posted with volume, issue, and page numbers. Once an issue is “full” online, a new issue opens and is available on the current issue page.

<< Previous

Table of Contents

Volume 22, Issue 1, Winter 2010

From the Editor

free access

From the Editor
John W. Chinneck
22(1), pp. 1–1
Published Online: February 1, 2010
10.1287/ijoc.1090.0371
Citation | PDF (50 KB) | Permissions 

Feature Article

no access

Feature Article—Merging AI and OR to Solve High-Dimensional Stochastic Optimization Problems Using Approximate Dynamic Programming
Warren B. Powell
22(1), pp. 2–17
Published Online: October 2, 2009
10.1287/ijoc.1090.0349
Preview | Abstract | References | PDF (194 KB) | Permissions 

Commentary

no access

Commentary—Perspectives on Stochastic Optimization Over Time
John N. Tsitsiklis
22(1), pp. 18–19
Published Online: October 2, 2009
10.1287/ijoc.1090.0350
Citation | References | PDF (45 KB) | Permissions 

no access

Commentary—Post-Decision States and Separable Approximations Are Powerful Tools of Approximate Dynamic Programming
Andrzej Ruszczyński
22(1), pp. 20–22
Published Online: October 2, 2009
10.1287/ijoc.1090.0351
Citation | References | PDF (63 KB) | Permissions 

Rejoinder

no access

Rejoinder—The Languages of Stochastic Optimization
Warren B. Powell
22(1), pp. 23–25
Published Online: October 2, 2009
10.1287/ijoc.1090.0352
Citation | References | PDF (61 KB) | Permissions 

Research Article

no access

Convexity and Concavity Detection in Computational Graphs: Tree Walks for Convexity Assessment
Robert Fourer, Chandrakant Maheshwari, Arnold Neumaier, Dominique Orban, Hermann Schichl
22(1), pp. 26–43
Published Online: July 29, 2009
10.1287/ijoc.1090.0321
Preview | Abstract | References | PDF (188 KB) | Permissions 

no access

Nonconvex Robust Optimization for Problems with Constraints
Dimitris Bertsimas, Omid Nohadani, Kwong Meng Teo
22(1), pp. 44–58
Published Online: May 19, 2009
10.1287/ijoc.1090.0319
Preview | Abstract | References | PDF (609 KB) | Permissions 

no access

A Heuristic for Nonlinear Global Optimization
M. Bierlaire, M. Thémans, N. Zufferey
22(1), pp. 59–70
Published Online: August 18, 2009
10.1287/ijoc.1090.0343
Preview | Abstract | References | PDF (563 KB) | Supplemental | Permissions 

no access

Sequential Sampling to Myopically Maximize the Expected Value of Information
Stephen E. Chick, Jürgen Branke, Christian Schmidt
22(1), pp. 71–80
Published Online: June 29, 2009
10.1287/ijoc.1090.0327
Preview | Abstract | References | PDF (167 KB) | Supplemental | Permissions 

no access

An Algorithm for Fast Generation of Bivariate Poisson Random Vectors
Kaeyoung Shin, Raghu Pasupathy
22(1), pp. 81–92
Published Online: August 18, 2009
10.1287/ijoc.1090.0332
Preview | Abstract | References | PDF (975 KB) | Supplemental | Permissions 

no access

A Generalized Wedelin Heuristic for Integer Programming
Oliver Bastert, Benjamin Hummel, Sven de Vries
22(1), pp. 93–107
Published Online: July 29, 2009
10.1287/ijoc.1090.0328
Preview | Abstract | References | PDF (313 KB) | Supplemental | Permissions 

no access

Pruning Moves
Matteo Fischetti, Domenico Salvagnin
22(1), pp. 108–119
Published Online: July 29, 2009
10.1287/ijoc.1090.0329
Preview | Abstract | References | PDF (168 KB) | Permissions 

no access

Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition
Barry McCollum, Andrea Schaerf, Ben Paechter, Paul McMullan, Rhyd Lewis, Andrew J. Parkes, Luca Di Gaspero, Rong Qu, Edmund K. Burke
22(1), pp. 120–130
Published Online: May 19, 2009
10.1287/ijoc.1090.0320
Preview | Abstract | References | PDF (123 KB) | Permissions 

no access

An Inexact Bundle Approach to Cutting-Stock Problems
Krzysztof C. Kiwiel
22(1), pp. 131–143
Published Online: June 29, 2009
10.1287/ijoc.1090.0326
Preview | Abstract | References | PDF (211 KB) | Supplemental | Permissions 

no access

Feasibility and Constraint Analysis of Sets of Linear Matrix Inequalities
Richard J. Caron, Tim Traynor, Shafiu Jibrin
22(1), pp. 144–153
Published Online: June 29, 2009
10.1287/ijoc.1090.0323
Preview | Abstract | References | PDF (493 KB) | Permissions 

no access

Binarized Support Vector Machines
Emilio Carrizosa, Belen Martin-Barragan, Dolores Romero Morales
22(1), pp. 154–167
Published Online: April 7, 2009
10.1287/ijoc.1090.0317
Preview | Abstract | References | PDF (189 KB) | Permissions 

no access

Exact Algorithms for the Quadratic Linear Ordering Problem
Christoph Buchheim, Angelika Wiegele, Lanbo Zheng
22(1), pp. 168–177
Published Online: May 19, 2009
10.1287/ijoc.1090.0318
Preview | Abstract | References | PDF (142 KB) | Supplemental | Permissions 

Current Issue

Archive

Subscribe

Book Reviews

Submit a Manuscript

Quicklinks & Resources

No search history

No recently viewed articles

  Follow Informs                                                        

INFORMS  • 5521 Research Park Drive, Suite 200, Catonsville, MD 21228 USA  •  +1-443-757-3500  •  informs@informs.org