Note from the Editor

Research Articles

A New Upper Bound for the Euclidean TSP Constant

Pages:341–356

Published Online:September 5, 2025

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

Optimal System Adjustment Under Operational Constraints with Applications to Infectious Disease Screening

Pages:357–376

Published Online:April 1, 2025

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

Scheduling with Calibrations for Multi-Interval Jobs

Pages:377–396

Published Online:April 3, 2025

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

Refined Wasserstein Distributionally Robust Optimization for Contract Pricing: The Value of Optimality Conditions in Transactions

Pages:397–413

Published Online:March 31, 2025

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

MIP-DD: Delta Debugging for Mixed-Integer Programming Solvers

Pages:414–423

Published Online:April 10, 2025

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

A Bilevel Network Interdiction Problem to Minimize the Number of Active Special Arcs in the Maximum Flow

Pages:424–446

Published Online:April 14, 2025

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

An Exact Solution Approach for Hierarchical Clustering

Pages:447–462

Published Online:April 17, 2025

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

Machine Learning-Empowered Benders Decomposition for Flow Hub Location in E-Commerce

Pages:463–489

Published Online:April 23, 2025

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

A Penalized Sequential Convex Programming Approach for Continuous Network Design Problems

Pages:490–506

Published Online:April 14, 2025

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

Real-Time Rolling Stock and Timetable Rescheduling in Urban Rail Transit Systems

Pages:507–530

Published Online:April 18, 2025

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

Divide and Contrast: A Text-Based Method for Firm Market Risk Prediction

Pages:531–547

Published Online:April 25, 2025

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

Solving Combinatorial Pricing Problems Using Embedded Dynamic Programming Models

Pages:548–567

Published Online:April 28, 2025

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

Asymptotically Tight MILP Approximations for a Nonconvex QCP

Pages:568–589

Published Online:May 12, 2025

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

Sempervirens: A Fast Reconstruction Algorithm for Noisy and Incomplete Binary Matrix Representations of Trees

Pages:590–604

Published Online:May 13, 2025

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

Solving Two-Stage Programs with Endogenous Uncertainty via Random Variable Transformation

Pages:605–624

Published Online:May 15, 2025

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

Two-Stage Dynamic Fusion Framework for Multimodal Classification Tasks

Pages:625–644

Published Online:May 29, 2025

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

Open Access
Spatial Branch-and-Bound for Nonconvex Separable Piecewise Linear Optimization

Pages:645–675

Published Online:June 27, 2025

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

Toward Graph Data Collaboration in a Data-Sharing-Free Manner: A Novel Privacy-Preserving Graph Pretraining Model

Pages:676–691

Published Online:June 4, 2025

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

Editorial Board

Free Access
Editorial Board

Pages:iii–iii

Published Online:April 13, 2026

https://doi.org/10.1287/ijoc.2026.eb.v3802

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.