Help
Cart
Skip main navigation

Available Issues

April 12, 2013 - June 15, 2026

Available Issues

April 12, 2013 - June 15, 2026

In Memoriam

Free Access
In Memoriam: Shabbir Ahmed (1969–2019)

Pages:633–635

Published Online:October 16, 2019

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

Research Articles

Toward Computing the Margin of Victory in Single Transferable Vote Elections

Pages:636–653

Published Online:May 29, 2019

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

Preview Abstract
Vehicle Routing with Space- and Time-Correlated Stochastic Travel Times: Evaluating the Objective Function

Pages:654–670

Published Online:June 27, 2019

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

Preview Abstract
Learning to Rank in Entity Relationship Graphs

Pages:671–688

Published Online:June 7, 2019

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

Preview Abstract
Surrogate Optimization of Computationally Expensive Black-Box Problems with Hidden Constraints

Pages:689–702

Published Online:July 5, 2019

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

Preview Abstract
Identification of Essential Proteins Using Induced Stars in Protein–Protein Interaction Networks

Pages:703–718

Published Online:June 14, 2019

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

Preview Abstract
Group Maintenance: A Restless Bandits Approach

Pages:719–731

Published Online:June 19, 2019

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

Preview Abstract
Planning for Overtime: The Value of Shift Extensions in Physician Scheduling

Pages:732–744

Published Online:June 19, 2019

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

Preview Abstract
An Efficient Morris Method-Based Framework for Simulation Factor Screening

Pages:745–770

Published Online:June 25, 2019

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

Preview Abstract
Level 2 Reformulation Linearization Technique–Based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters

Pages:771–789

Published Online:September 20, 2019

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

Preview Abstract
Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets

Pages:790–804

Published Online:June 14, 2019

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

Preview Abstract
Branch-and-Bound for Bi-objective Integer Programming

Pages:805–822

Published Online:July 8, 2019

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

Preview Abstract
A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs

Pages:823–840

Published Online:June 19, 2019

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

Preview Abstract

Appreciation to Reviewers

Free Access
Appreciation to Reviewers

Pages:841–845

Published Online:October 31, 2019

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

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