Help
Cart
Skip main navigation

Available Issues

April 12, 2013 - April 13, 2026

Available Issues

April 12, 2013 - April 13, 2026

Editorial

Free Access
From the Editor

Pages:1–1

Published Online:February 1, 2006

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

Board of Directors and Editors for 2006

Free Access
Institute for Operations Research and the Management Sciences—Board of Directors and Editors for 2006

Pages:2–2

Published Online:February 1, 2006

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

Research Article

An Automated Multiresolution Procedure for Modeling Complex Arrival Processes

Pages:3–18

Published Online:February 1, 2006

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

Preview Abstract
The Distribution of Order Statistics for Discrete Random Variables with Applications to Bootstrapping

Pages:19–30

Published Online:February 1, 2006

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

Preview Abstract
Dynamic-Programming Approximations for Stochastic Time-Staged Integer Multicommodity-Flow Problems

Pages:31–42

Published Online:February 1, 2006

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

Preview Abstract
A Metastrategy for Large-Scale Resource Management Based on Informational Decomposition

Pages:43–60

Published Online:February 1, 2006

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

Preview Abstract
A Computational Study of Cost Reoptimization for Min-Cost Flow Problems

Pages:61–70

Published Online:February 1, 2006

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

Preview Abstract
A Set-Covering-Based Heuristic Approach for Bin-Packing Problems

Pages:71–85

Published Online:February 1, 2006

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

Preview Abstract
Early Estimates of the Size of Branch-and-Bound Trees

Pages:86–96

Published Online:February 1, 2006

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

Preview Abstract
Algorithms for the Frame of a Finitely Generated Unbounded Polyhedron

Pages:97–110

Published Online:February 1, 2006

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

Preview Abstract
A New Mathematical-Programming Framework for Facility-Layout Design

Pages:111–118

Published Online:February 1, 2006

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

Preview Abstract
An Improved Augmented Neural-Network Approach for Scheduling Problems

Pages:119–128

Published Online:February 1, 2006

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

Preview Abstract
A Column-Generation Approach to the Multiple Knapsack Problem with Color Constraints

Pages:129–134

Published Online:February 1, 2006

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

Preview Abstract
Previous
Back to Top
Next
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.
Agree