Skip to content

INFORMS Journal on Computing

Volume 25 · Issue 2

May 201314 articles

A Binary Search Heuristic Algorithm Based on Randomized Local Search for the Rectangular Strip-Packing Problem

Defu Zhang · Lijun Wei · Stephen C. H. Leung · Qingshan Chen

Discuss this article →

May 2013pp. 332-345DOI: 10.1287/ijoc.1120.0505 ↗

A New Local Search Algorithm for Binary Optimization

Dimitris Bertsimas · Dan A. Iancu · Dmitriy Katz

Discuss this article →

May 2013pp. 208-221DOI: 10.1287/ijoc.1110.0496 ↗

A Powerful Genetic Algorithm Using Edge Assembly Crossover for the Traveling Salesman Problem

Yuichi Nagata · Shigenobu Kobayashi

Discuss this article →

May 2013pp. 346-363DOI: 10.1287/ijoc.1120.0506 ↗

An Algorithm for Approximating Convex Pareto Surfaces Based on Dual Techniques

Rasmus Bokrantz · Anders Forsgren

Discuss this article →

May 2013pp. 377-393DOI: 10.1287/ijoc.1120.0508 ↗

An Exact Algorithm for the Multitrip Vehicle Routing Problem

Aristide Mingozzi · Roberto Roberti · Paolo Toth

Discuss this article →

May 2013pp. 193-207DOI: 10.1287/ijoc.1110.0495 ↗

Bin Packing with Conflicts: A Generic Branch-and-Price Algorithm

Ruslan Sadykov · François Vanderbeck

Discuss this article →

May 2013pp. 244-255DOI: 10.1287/ijoc.1120.0499 ↗

Branch-and-Price Guided Search for Integer Programs with an Application to the Multicommodity Fixed-Charge Network Flow Problem

Mike Hewitt · George Nemhauser · Martin W. P. Savelsbergh

Discuss this article →

May 2013pp. 302-316DOI: 10.1287/ijoc.1120.0503 ↗

Critically Loaded Time-Varying Multiserver Queues: Computational Challenges and Approximations

Young Myoung Ko · Natarajan Gautam

Discuss this article →

May 2013pp. 285-301DOI: 10.1287/ijoc.1120.0502 ↗

Expected Tardiness Computations in Multiclass Priority M/M/c Queues

A. Baykal Hafızoğlu · Esma S. Gel · Pınar Keskinocak

Discuss this article →

May 2013pp. 364-376DOI: 10.1287/ijoc.1120.0507 ↗

Layered Graph Approaches to the Hop Constrained Connected Facility Location Problem

Ivana Ljubić · Stefan Gollowitzer

Discuss this article →

May 2013pp. 256-270DOI: 10.1287/ijoc.1120.0500 ↗

On Maximum Speedup Ratio of Restart Algorithm Portfolios

Oleksii Mostovyi · Oleg A. Prokopyev · Oleg V. Shylo

Discuss this article →

May 2013pp. 222-229DOI: 10.1287/ijoc.1120.0497 ↗

Rapid Screening Procedures for Zero-One Optimization via Simulation

Shing Chih Tsai

Discuss this article →

May 2013pp. 317-331DOI: 10.1287/ijoc.1120.0504 ↗

Stochastic Trust-Region Response-Surface Method (STRONG)—A New Response-Surface Framework for Simulation Optimization

Kuo-Hao Chang · L. Jeff Hong · Hong Wan

Discuss this article →

May 2013pp. 230-243DOI: 10.1287/ijoc.1120.0498 ↗

Valid Linear Programming Bounds for Exact Mixed-Integer Programming

Daniel E. Steffy · Kati Wolter

Discuss this article →

May 2013pp. 271-284DOI: 10.1287/ijoc.1120.0501 ↗