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:485–485

Published Online:November 1, 2007

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

Research Article

Constructing Ensembles from Data Envelopment Analysis

Pages:486–496

Published Online:July 20, 2007

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

Preview Abstract
A Stochastic Radial Basis Function Method for the Global Optimization of Expensive Functions

Pages:497–509

Published Online:July 20, 2007

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

Preview Abstract
Improving Web-Catalog Design for Easy Product Search

Pages:510–519

Published Online:July 25, 2007

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

Preview Abstract
A Shortest-Paths Heuristic for Statistical Data Protection in Positive Tables

Pages:520–533

Published Online:July 25, 2007

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

Preview Abstract
An Evolutionary Algorithm for Polishing Mixed Integer Programming Solutions

Pages:534–541

Published Online:July 25, 2007

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

Preview Abstract
On the Distributed Bellman-Ford Algorithm and the Looping Problem

Pages:542–551

Published Online:July 20, 2007

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

Preview Abstract
Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem

Pages:552–564

Published Online:July 20, 2007

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

Preview Abstract
A Traffic-Grooming Algorithm for Wavelength-Routed Optical Networks

Pages:565–574

Published Online:July 20, 2007

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

Preview Abstract
Asynchronous Cooperative Local Search for the Office-Space-Allocation Problem

Pages:575–587

Published Online:November 1, 2007

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

Preview Abstract
Multi-Issue Automated Negotiations Using Agents

Pages:588–595

Published Online:November 1, 2007

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

Preview Abstract
A (2/3)n3 Fast-Pivoting Algorithm for the Gittins Index and Optimal Stopping of a Markov Chain

Pages:596–606

Published Online:November 1, 2007

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

Preview Abstract
Dynamic Programming to Minimize the Maximum Number of Open Stacks

Pages:607–617

Published Online:November 1, 2007

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

Preview Abstract
Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading

Pages:618–632

Published Online:November 1, 2007

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

Preview Abstract
Rescheduling for Multiple New Orders

Pages:633–645

Published Online:November 1, 2007

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

Preview Abstract
Very Large-Scale Neighborhood Search for the Quadratic Assignment Problem

Pages:646–657

Published Online:August 31, 2007

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

Preview Abstract

Appreciation to Referees

Free Access
Appreciation to Referees

Pages:658–660

Published Online:November 1, 2007

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

Author Index

Free Access
Author Index

Pages:661–662

Published Online:November 1, 2007

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

Key Word Index

Free Access
Key Word Index

Pages:663–664

Published Online:November 1, 2007

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

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