Research Articles

On the Derivation of Continuous Piecewise Linear Approximating Functions

Pages:531–546

Published Online:May 5, 2020

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

Branch and Price for Chance-Constrained Bin Packing

Pages:547–564

Published Online:January 14, 2020

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

Domination Measure: A New Metric for Solving Multiobjective Optimization

Pages:565–581

Published Online:January 30, 2020

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

A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem

Pages:582–599

Published Online:July 2, 2020

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

MILP Models for Complex System Reliability Redundancy Allocation with Mixed Components

Pages:600–619

Published Online:January 8, 2020

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

Distributionally Robust Design for Redundancy Allocation

Pages:620–640

Published Online:February 27, 2020

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

Optimization-based Mechanisms for the Course Allocation Problem

Pages:641–660

Published Online:January 13, 2020

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

Robust Optimization of a Broad Class of Heterogeneous Vehicle Routing Problems Under Demand Uncertainty

Pages:661–681

Published Online:January 16, 2020

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

Convex Relaxations for Quadratic On/Off Constraints and Applications to Optimal Transmission Switching

Pages:682–696

Published Online:February 11, 2020

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

Transient-State Natural Gas Transmission in Gunbarrel Pipeline Networks

Pages:697–713

Published Online:February 25, 2020

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

Learning to Correlate Accounts Across Online Social Networks: An Embedding-Based Approach

Pages:714–729

Published Online:July 6, 2020

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

Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms

Pages:730–746

Published Online:January 24, 2020

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

A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem

Pages:747–762

Published Online:January 24, 2020

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

An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph

Pages:763–778

Published Online:February 3, 2020

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

Differentially Private Distributed Learning

Pages:779–789

Published Online:March 4, 2020

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

Differentially Private and Budget-Limited Bandit Learning over Matroids

Pages:790–804

Published Online:March 16, 2020

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

Optimization-Driven Scenario Grouping

Pages:805–821

Published Online:March 13, 2020

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

When Lift-and-Project Cuts Are Different

Pages:822–834

Published Online:February 4, 2020

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

Assortment Optimization Under the Multinomial Logit Model with Sequential Offerings

Pages:835–853

Published Online:March 16, 2020

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

Editorial Board

Free Access
Editorial Board

Pages:C2–C2

Published Online:August 5, 2020

https://doi.org/10.1287/ijoc.2020.eb.v3203

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.