Help
Cart
Skip main navigation

Available Issues

April 12, 2013 - April 13, 2026

Available Issues

April 12, 2013 - April 13, 2026

From the Editor

Free Access
From the Editor

Pages:1–1

Published Online:February 1, 2005

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

Board of Directors and Editors for 2005

Free Access
Institute for Operations Research and the Management Sciences: Board of Directors and Editors for 2005

Pages:2–2

Published Online:February 1, 2005

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

Research Article

On the Generality of Event-Graph Models

Pages:3–9

Published Online:February 1, 2005

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

Preview Abstract
Meta-Heuristics for a Class of Demand-Responsive Transit Systems

Pages:10–24

Published Online:February 1, 2005

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

Preview Abstract
Oblique Multicategory Decision Trees Using Nonlinear Programming

Pages:25–31

Published Online:February 1, 2005

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

Preview Abstract
A GRASP for Parallel Machine Scheduling with Time Windows

Pages:32–51

Published Online:February 1, 2005

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

Preview Abstract
Constraint-Propagation-Based Cutting Planes: An Application to the Resource-Constrained Project Scheduling Problem

Pages:52–65

Published Online:February 1, 2005

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

Preview Abstract
Numerical Solutions of Renewal-Type Integral Equations

Pages:66–74

Published Online:February 1, 2005

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

Preview Abstract
A Two-Moment Approximation for the GI/G/c Queue with Finite Capacity

Pages:75–81

Published Online:February 1, 2005

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

Preview Abstract
A Local-Search-Based Heuristic for the Demand-Constrained Multidimensional Knapsack Problem

Pages:82–98

Published Online:February 1, 2005

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

Preview Abstract
Optimal Processing Policies for an e-Commerce Web Server

Pages:99–110

Published Online:February 1, 2005

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

Preview Abstract
Context-Independent Scatter and Tabu Search for Permutation Problems

Pages:111–122

Published Online:February 1, 2005

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

Preview Abstract
An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems

Pages:123–136

Published Online:February 1, 2005

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

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