Volume 19 · Issue 1

February 200715 articles

A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows

Jeffrey W. Ohlmann · Barrett W. Thomas

Discuss this article →

February 2007pp. 80-90DOI: 10.1287/ijoc.1050.0145 ↗

A Heuristic Approach to the Multi-Period Single-Sourcing Problem with Production and Inventory Capacities and Perishability Constraints

Ravindra K. Ahuja · Wei Huang · H. Edwin Romeijn · Dolores Romero Morales

Discuss this article →

February 2007pp. 14-26DOI: 10.1287/ijoc.1050.0151 ↗

Algorithmic Analysis of the Maximum Queue Length in a Busy Period for the M/M/c Retrial Queue

Jesus R. Artalejo · Antonis Economou · M. J. Lopez-Herrero

Discuss this article →

February 2007pp. 121-126DOI: 10.1287/ijoc.1050.0156 ↗

Enhancing Lagrangian Dual Optimization for Linear Programs by Obviating Nondifferentiability

Hanif D. Sherali · Churlzu Lim

Discuss this article →

February 2007pp. 3-13DOI: 10.1287/ijoc.1050.0158 ↗

Enumeration of Pareto Optima for a Flowshop Scheduling Problem with Two Criteria

Vincent T’kindt · Federico Della Croce · Jean-Louis Bouquard

Discuss this article →

February 2007pp. 64-72DOI: 10.1287/ijoc.1050.0167 ↗

From the Editor

Prakash Mirchandani

Discuss this article →

February 2007pp. 1-1DOI: 10.1287/ijoc.1070.0223 ↗

Implementing Sponsored Search in Web Search Engines: Computational Evaluation of Alternative Mechanisms

Juan Feng · Hemant K. Bhargava · David M. Pennock

Discuss this article →

February 2007pp. 137-148DOI: 10.1287/ijoc.1050.0135 ↗

Improving Linkage of Web Pages

Rakesh Gupta · Amitava Bagchi · Sumit Sarkar

Discuss this article →

February 2007pp. 127-136DOI: 10.1287/ijoc.1050.0147 ↗

Linear Complementarity as a General Solution Method to Combinatorial Problems

Laura Di Giacomo · Giacomo Patrizi · Emanuele Argento

Discuss this article →

February 2007pp. 73-79DOI: 10.1287/ijoc.1050.0146 ↗

Performance Guarantees of Local Search for Multiprocessor Scheduling

Petra Schuurman · Tjark Vredeveld

Discuss this article →

February 2007pp. 52-63DOI: 10.1287/ijoc.1050.0152 ↗

Setup and Open-Stacks Minimization in One-Dimensional Stock Cutting

Gleb Belov · Guntram Scheithauer

Discuss this article →

February 2007pp. 27-35DOI: 10.1287/ijoc.1050.0132 ↗

Simulation Allocation for Determining the Best Design in the Presence of Correlated Sampling

Michael C. Fu · Jian-Qiang Hu · Chun-Hung Chen · Xiaoping Xiong

Discuss this article →

February 2007pp. 101-111DOI: 10.1287/ijoc.1050.0141 ↗

SSPMO: A Scatter Tabu Search Procedure for Non-Linear Multiobjective Optimization

Julian Molina · Manuel Laguna · Rafael Martí · Rafael Caballero

Discuss this article →

February 2007pp. 91-100DOI: 10.1287/ijoc.1050.0149 ↗

Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem

David Pisinger · Mikkel Sigurd

Discuss this article →

February 2007pp. 36-51DOI: 10.1287/ijoc.1060.0181 ↗

Waiting-Time Distribution of M/DN/1 Queues Through Numerical Laplace Inversion

John F. Shortle · Martin J. Fischer · Percy H. Brill

Discuss this article →

February 2007pp. 112-120DOI: 10.1287/ijoc.1050.0148 ↗