From the Editor

From the Editor

Pages:395–395

Published Online:August 1, 2013

https://doi.org/10.1287/ijoc.2013.0562

Research Article

Robust Modified Policy Iteration

Pages:396–410

Published Online:June 6, 2012

https://doi.org/10.1287/ijoc.1120.0509

A Time Predefined Variable Depth Search for Nurse Rostering

Pages:411–419

Published Online:June 6, 2012

https://doi.org/10.1287/ijoc.1120.0510

Separation and Extension of Cover Inequalities for Conic Quadratic Knapsack Constraints with Generalized Upper Bounds

Pages:420–431

Published Online:June 6, 2012

https://doi.org/10.1287/ijoc.1120.0511

I-SMOOTH: Iteratively Smoothing Mean-Constrained and Nonnegative Piecewise-Constant Functions

Pages:432–445

Published Online:June 29, 2012

https://doi.org/10.1287/ijoc.1120.0512

Column Generation for the Minimum Hyperplanes Clustering Problem

Pages:446–460

Published Online:June 29, 2012

https://doi.org/10.1287/ijoc.1120.0513

Grammar-Based Column Generation for Personalized Multi-Activity Shift Scheduling

Pages:461–474

Published Online:June 29, 2012

https://doi.org/10.1287/ijoc.1120.0514

Combining Lift-and-Project and Reduce-and-Split

Pages:475–487

Published Online:June 29, 2012

https://doi.org/10.1287/ijoc.1120.0515

Scenario Trees and Policy Selection for Multistage Stochastic Programming Using Machine Learning

Pages:488–501

Published Online:August 14, 2012

https://doi.org/10.1287/ijoc.1120.0516

Self-Organized Formation and Evolution of Peer-to-Peer Networks

Pages:502–516

Published Online:June 29, 2012

https://doi.org/10.1287/ijoc.1120.0517

Base Model Combination Algorithm for Resolving Tied Predictions for K-Nearest Neighbor OVA Ensemble Models

Pages:517–526

Published Online:August 14, 2012

https://doi.org/10.1287/ijoc.1120.0518

Optimal Sampling Laws for Stochastically Constrained Simulation Optimization on Finite Sets

Pages:527–542

Published Online:September 14, 2012

https://doi.org/10.1287/ijoc.1120.0519

Flexible Process Compliance with Semantic Constraints Using Mixed-Integer Programming

Pages:543–559

Published Online:September 14, 2012

https://doi.org/10.1287/ijoc.1120.0520

Uncommon Dantzig-Wolfe Reformulation for the Temporal Knapsack Problem

Pages:560–571

Published Online:October 22, 2012

https://doi.org/10.1287/ijoc.1120.0521

Approximation Algorithms for Integrated Distribution Network Design Problems

Pages:572–584

Published Online:September 14, 2012

https://doi.org/10.1287/ijoc.1120.0522

Exact Algorithms for a Bandwidth Packing Problem with Queueing Delay Guarantees

Pages:585–596

Published Online:September 14, 2012

https://doi.org/10.1287/ijoc.1120.0523

Book Reviews

Book Reviews

Pages:597–598

Published Online:August 1, 2013

https://doi.org/10.1287/ijoc.2013.0566

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.