Kai Nagel, Peter Wagner, and Richard Woesler

Still Flowing: Approaches to Traffic Flow and Traffic Jam Modeling
OPERATIONS RESEARCH 2003 51: 681-710. [Abstract] [PDF] [References]  

Meltem Denizel, Behlul Usdiken, and Deniz Tuncalp

Drift or Shift? Continuity, Change, and International Variation in Knowledge Production in OR/MS
OPERATIONS RESEARCH 2003 51: 711-720. [Abstract] [PDF] [References]  

Gadi Fibich, Arieh Gavious, and Oded Lowengart

Explicit Solutions of Optimization Models and Differential Games with Nonsmooth (Asymmetric) Reference-Price Effects
OPERATIONS RESEARCH 2003 51: 721-734. [Abstract] [PDF] [References]  

Chung-Yee Lee, Sila Çetinkaya, and Wikrom Jaruphongsa

A Dynamic Model for Inventory Lot Sizing and Outbound Shipment Scheduling at a Third-Party Warehouse
OPERATIONS RESEARCH 2003 51: 735-747. [Abstract] [PDF] [References]  

Alan Scheller-Wolf

Necessary and Sufficient Conditions for Delay Moments in FIFO Multiserver Queues with an Application Comparing s Slow Servers with One Fast One
OPERATIONS RESEARCH 2003 51: 748-758. [Abstract] [PDF] [References]  

Jian Yang and Joseph Y.-T. Leung

The Ordered Open-End Bin-Packing Problem
OPERATIONS RESEARCH 2003 51: 759-770. [Abstract] [PDF] [References]  

Daniel Granot and Greys SoSic

A Three-Stage Model for a Decentralized Distribution System of Retailers
OPERATIONS RESEARCH 2003 51: 771-784. [Abstract] [PDF] [References]  

Dorit S. Hochbaum

Efficient Algorithms for the Inverse Spanning-Tree Problem
OPERATIONS RESEARCH 2003 51: 785-797. [Abstract] [PDF] [References]  

Dimitris Bertsimas, David Gamarnik, and Jay Sethuraman

From Fluid Relaxations to Practical Algorithms for High-Multiplicity Job-Shop Scheduling: The Holding Cost Objective
OPERATIONS RESEARCH 2003 51: 798-813. [Abstract] [PDF] [References]  

Justin Boesel, Barry L. Nelson, and Seong-Hee Kim

Using Ranking and Selection to "Clean Up" after Simulation Optimization
OPERATIONS RESEARCH 2003 51: 814-825. [Abstract] [PDF] [References]  

Silvano Martello and Paolo Toth

An Exact Algorithm for the Two-Constraint 0–1 Knapsack Problem
OPERATIONS RESEARCH 2003 51: 826-835. [Abstract] [PDF] [References]  

Contributors
OPERATIONS RESEARCH 2003 51: 836-838. [PDF]  

To see an article, click its [Full Text] or [PDF] link. To review many abstracts, check the boxes to the left of the titles you want, and click the 'Get All Checked Abstract(s)' button. To see one abstract at a time, click its [Abstract] link.