Volume 27 · Issue 2

April 201515 articles

A Network Structural Approach to the Link Prediction Problem

Chungmok Lee · Minh Pham · Myong K. Jeong · Dohyun Kim · Dennis K. J. Lin · Wanpracha Art Chavalitwongse

Discuss this article →

April 2015pp. 249-267DOI: 10.1287/ijoc.2014.0624 ↗

A New Semidefinite Programming Relaxation for the Quadratic Assignment Problem and Its Computational Perspectives

E. de Klerk · R. Sotirov · U. Truetsch

Discuss this article →

April 2015pp. 378-391DOI: 10.1287/ijoc.2014.0634 ↗

A Scenario Decomposition Algorithm for Stochastic Programming Problems with a Class of Downside Risk Measures

Maciej Rysz · Alexander Vinel · Pavlo Krokhmal · Eduardo L. Pasiliao

Discuss this article →

April 2015pp. 416-430DOI: 10.1287/ijoc.2014.0635 ↗

Approximation Methods for Pricing Problems Under the Nested Logit Model with Price Bounds

W. Zachary Rayfield · Paat Rusmevichientong · Huseyin Topaloglu

Discuss this article →

April 2015pp. 335-357DOI: 10.1287/ijoc.2014.0629 ↗

Chance Constrained Selection of the Best

L. Jeff Hong · Jun Luo · Barry L. Nelson

Discuss this article →

April 2015pp. 317-334DOI: 10.1287/ijoc.2014.0628 ↗

Chance-Constrained Programming Models and Approximations for General Stochastic Bottleneck Spanning Tree Problems

Siqian Shen · Murat Kurt · Jue Wang

Discuss this article →

April 2015pp. 301-316DOI: 10.1287/ijoc.2014.0627 ↗

Computing in Operations Research Using Julia

Miles Lubin · Iain Dunning

Discuss this article →

April 2015pp. 238-248DOI: 10.1287/ijoc.2014.0623 ↗

Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints

Zhang-Hua Fu · Jin-Kao Hao

Discuss this article →

April 2015pp. 221-237DOI: 10.1287/ijoc.2014.0622 ↗

Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem

Fabio Furini · Manuel Iori · Silvano Martello · Mutsunori Yagiura

Discuss this article →

April 2015pp. 392-405DOI: 10.1287/ijoc.2014.0632 ↗

Importance Sampling in Stochastic Programming: A Markov Chain Monte Carlo Approach

Panos Parpas · Berk Ustun · Mort Webster · Quang Kha Tran

Discuss this article →

April 2015pp. 358-377DOI: 10.1287/ijoc.2014.0630 ↗

Model Counting of Monotone Conjunctive Normal Form Formulas with Spectra

Radislav Vaisman · Ofer Strichman · Ilya Gertsbakh

Discuss this article →

April 2015pp. 406-415DOI: 10.1287/ijoc.2014.0633 ↗

Multivariate Mixtures of Normal Distributions: Properties, Random Vector Generation, Fitting, and as Models of Market Daily Changes

Jin Wang · Michael R. Taaffe

Discuss this article →

April 2015pp. 193-203DOI: 10.1287/ijoc.2014.0616 ↗

Optimal Budget Allocation Across Search Advertising Markets

Yanwu Yang · Daniel Zeng · Yinghui Yang · Jie Zhang

Discuss this article →

April 2015pp. 285-300DOI: 10.1287/ijoc.2014.0626 ↗

Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search

Diarmuid Grimes · Emmanuel Hebrard

Discuss this article →

April 2015pp. 268-284DOI: 10.1287/ijoc.2014.0625 ↗

The Generalized Regenerator Location Problem

Si Chen · Ivana Ljubić · S. Raghavan

Discuss this article →

April 2015pp. 204-220DOI: 10.1287/ijoc.2014.0621 ↗