Research Articles

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

Pages:193–203

Published Online:March 3, 2015

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

The Generalized Regenerator Location Problem

Pages:204–220

Published Online:March 16, 2015

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

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

Pages:221–237

Published Online:March 16, 2015

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

Computing in Operations Research Using Julia

Pages:238–248

Published Online:March 16, 2015

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

A Network Structural Approach to the Link Prediction Problem

Pages:249–267

Published Online:March 25, 2015

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

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

Pages:268–284

Published Online:April 6, 2015

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

Optimal Budget Allocation Across Search Advertising Markets

Pages:285–300

Published Online:April 6, 2015

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

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

Pages:301–316

Published Online:April 8, 2015

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

Chance Constrained Selection of the Best

Pages:317–334

Published Online:April 14, 2015

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

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

Pages:335–357

Published Online:April 15, 2015

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

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

Pages:358–377

Published Online:April 24, 2015

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

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

Pages:378–391

Published Online:May 4, 2015

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

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

Pages:392–405

Published Online:May 5, 2015

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

Model Counting of Monotone Conjunctive Normal Form Formulas with Spectra

Pages:406–415

Published Online:May 12, 2015

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

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

Pages:416–430

Published Online:May 12, 2015

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

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.