Research Articles

Computing Minimum k-Connected m-Fold Dominating Set in General Graphs

Pages:217–224

Published Online:March 20, 2018

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

Breaking the O(ln n) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set

Pages:225–235

Published Online:March 26, 2018

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

Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines

Pages:236–258

Published Online:April 2, 2018

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

Optimizing Chemoradiotherapy to Target Metastatic Disease and Tumor Growth

Pages:259–277

Published Online:April 5, 2018

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

Some Monotonicity Results for Stochastic Kriging Metamodels in Sequential Settings

Pages:278–294

Published Online:April 5, 2018

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

Randomized Decomposition Solver with the Quadratic Assignment Problem as a Case Study

Pages:295–308

Published Online:April 23, 2018

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

Solving Highly Detailed Gas Transport MINLPs: Block Separability and Penalty Alternating Direction Methods

Pages:309–323

Published Online:April 30, 2018

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

Efficient Storage of Pareto Points in Biobjective Mixed Integer Programming

Pages:324–338

Published Online:April 30, 2018

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

Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation

Pages:339–360

Published Online:May 15, 2018

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

An Open-Source Desktop Application for Generating Arc-Routing Benchmark Instances

Pages:361–370

Published Online:May 15, 2018

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

Optimal Design of the Seasonal Influenza Vaccine with Manufacturing Autonomy

Pages:371–387

Published Online:May 25, 2018

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

Partially Adaptive Stochastic Optimization for Electric Power Generation Expansion Planning

Pages:388–401

Published Online:May 25, 2018

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

A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems

Pages:402–420

Published Online:May 25, 2018

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

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.