Research Articles

The Recoverable Robust Two-Level Network Design Problem

Pages:1–19

Published Online:September 22, 2014

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

Statistical Database Auditing Without Query Denial Threat

Pages:20–34

Published Online:September 22, 2014

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

Column-Generation Framework of Nonlinear Similarity Model for Reconstructing Sibling Groups

Pages:35–47

Published Online:September 22, 2014

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

A Cutting-Plane Neighborhood Structure for Fixed-Charge Capacitated Multicommodity Network Design Problem

Pages:48–58

Published Online:September 22, 2014

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

Algorithmic Approach for Improved Mixed-Integer Reformulations of Convex Generalized Disjunctive Programs

Pages:59–74

Published Online:October 13, 2014

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

On Bounding the Bandwidth of Graphs with Symmetry

Pages:75–88

Published Online:October 28, 2014

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

Solving Hierarchical Stochastic Programs: Application to the Maritime Fleet Renewal Problem

Pages:89–102

Published Online:October 28, 2014

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

Maintaining Secure and Reliable Distributed Control Systems

Pages:103–117

Published Online:October 28, 2014

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

A Computational Study of Exact Approaches for the Bi-Objective Prize-Collecting Steiner Tree Problem

Pages:118–134

Published Online:December 23, 2014

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

A Strong Preemptive Relaxation for Weighted Tardiness and Earliness/Tardiness Problems on Unrelated Parallel Machines

Pages:135–150

Published Online:January 19, 2015

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

New Heuristic Approaches for the Bounded-Diameter Minimum Spanning Tree Problem

Pages:151–163

Published Online:January 19, 2015

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

Solving the Maximum Clique and Vertex Coloring Problems on Very Large Sparse Networks

Pages:164–177

Published Online:January 22, 2015

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

An Integer Programming Approach for Fault-Tolerant Connected Dominating Sets

Pages:178–188

Published Online:January 27, 2015

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

Book Reviews

Free Access
Book Reviews

Pages:189–192

Published Online:February 5, 2015

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

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.