INFORMS Journal on Computing

2017 - 2025

From INFORMS
Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().

Access Statistics for this journal.
Is something missing from the series or not right? See the RePEc data check for the archive and series.

Volume 36, issue 6, 2024

The Impact of Passive Social Media Viewers in Influence Maximization pp. 1362-1381

Michael Kahr, Markus Leitner and Ivana Ljubić

Constraint Learning to Define Trust Regions in Optimization over Pre-Trained Predictive Models pp. 1382-1399

Chenbo Shi, Mohsen Emadikhiav, Leonardo Lozano and David Bergman

Let the Laser Beam Connect the Dots: Forecasting and Narrating Stock Market Volatility pp. 1400-1416

Zhu (Drew) Zhang, Jie Yuan and Amulya Gupta

Exact Solution of the Single-Picker Routing Problem with Scattered Storage pp. 1417-1435

Katrin Heßler and Stefan Irnich

Unified Framework for Choice-Based Facility Location Problem pp. 1436-1458

Yun Hui Lin, Qingyun Tian and Yanlu Zhao

Path-Based Formulations for the Design of On-demand Multimodal Transit Systems with Adoption Awareness pp. 1459-1480

Hongzhao Guan, Beste Basciftci and Pascal Van Hentenryck

A FAST Method for Nested Estimation pp. 1481-1500

Guo Liang, Kun Zhang and Jun Luo

A Dual Bounding Framework Through Cost Splitting for Binary Quadratic Optimization pp. 1501-1521

Mahdis Bayani, Borzou Rostami, Yossiri Adulyasak and Louis-Martin Rousseau

Decision Diagram-Based Branch-and-Bound with Caching for Dominance and Suboptimality Detection pp. 1522-1542

Vianney Coppé, Xavier Gillard and Pierre Schaus

Regret Minimization and Separation in Multi-Bidder, Multi-Item Auctions pp. 1543-1561

Çağıl Koçyiğit, Daniel Kuhn and Napat Rujeerapaiboon

Decomposable Formulation of Transmission Constraints for Decentralized Power Systems Optimization pp. 1562-1578

Álinson Santos Xavier, Santanu Subhas Dey and Feng Qiu

Computing Optimality Certificates for Convex Mixed-Integer Nonlinear Problems pp. 1579-1610

Katrin Halbig, Lukas Hümbs, Florian Rösel, Lars Schewe and Dieter Weninger

Convergence Rates of Zeroth Order Gradient Descent for Łojasiewicz Functions pp. 1611-1633

Tianyu Wang and Yasong Feng

Computing Bipath Multicommodity Flows with Constraint Programming–Based Branch-and-Price-and-Cut pp. 1634-1653

Jiachen Zhang, Youcef Magnouche, Pierre Bauguion, Sebastien Martin and J. Christopher Beck

Rescheduling with New Orders Under Bounded Disruption pp. 1654-1675

Stefan Lendl, Ulrich Pferschy and Elena Rener

The Continuous Time-Resource Trade-off Scheduling Problem with Time Windows pp. 1676-1695

Christian Artigues, Emmanuel Hébrard, Alain Quilliot and Hélène Toussaint

A Flow-Based Formulation for Parallel Machine Scheduling Using Decision Diagrams pp. 1696-1714

Daniel Kowalczyk, Roel Leus, Christopher Hojny and Stefan Røpke

A Graph-Based Approach for Relating Integer Programs pp. 1715-1736

Zachary Steever, Kyle Hunt, Mark Karwan, Junsong Yuan and Chase C. Murray

Feasibility Verification and Upper Bound Computation in Global Minimization Using Approximate Active Index Sets pp. 1737-1756

Christian Füllner, Peter Kirst, Hendrik Otto and Steffen Rebennack

Volume 36, issue 5, 2024

Note from the Editor pp. 1147-1149

Alice E. Smith

Quadratic Optimization Models for Balancing Preferential Access and Fairness: Formulations and Optimality Conditions pp. 1150-1167

Christian Schmitt and Bismark Singh

Real-Time Derivative Pricing and Hedging with Consistent Metamodels pp. 1168-1189

Guangxin Jiang, L. Jeff Hong and Haihui Shen

Adaptive Influence Maximization: Adaptability via Nonadaptability pp. 1190-1200

Hongmin W. Du, Yingfan L. Du and Zhao Zhang

Appointment Scheduling with Delay Tolerance Heterogeneity pp. 1201-1224

Shuming Wang, Jun Li, Marcus Ang and Tsan Sheng Ng

Solving Bilevel Programs Based on Lower-Level Mond-Weir Duality pp. 1225-1241

Yu-Wei Li, Gui-Hua Lin and Xide Zhu

Cost-Effective Acquisition of First-Party Data for Business Analytics pp. 1242-1260

Xiaoping Liu and Xiao-Bai Li

Identifying Socially Optimal Equilibria Using Combinatorial Properties of Nash Equilibria in Bimatrix Games pp. 1261-1286

Amin Dehghanian, Yujia Xie and Nicoleta Serban

Exact Method for Production Hub Location pp. 1287-1315

Tao Wu

Finding Regions of Counterfactual Explanations via Robust Optimization pp. 1316-1334

Donato Maragno, Jannis Kurtz, Tabea E. Röber, Rob Goedhart, Ş. İlker Birbil and Dick den Hertog

An Integrated Predictive Maintenance and Operations Scheduling Framework for Power Systems Under Failure Uncertainty pp. 1335-1358

Bahar Cennet Okumuşoğlu, Beste Basciftci and Burak Kocuk

Volume 36, issue 4, 2024

Note from the Editor pp. 939-940

Alice E. Smith

Introduction to the Special Section on Software Tools for Vehicle Routing pp. 941-942

Nicholas D. Kullman, Jorge E. Mendoza and Ted K. Ralphs

PyVRP: A High-Performance VRP Solver Package pp. 943-955

Niels A. Wouda, Leon Lan and Wouter Kool

VRPSolverEasy: A Python Library for the Exact Solution of a Rich Vehicle Routing Problem pp. 956-965

Najib Errami, Eduardo Queiroga, Ruslan Sadykov and Eduardo Uchoa

RoutingBlocks: An Open-Source Python Package for Vehicle Routing Problems with Intermediate Stops pp. 966-973

Patrick S. Klein and Maximilian Schiffer

AILS-II: An Adaptive Iterated Local Search Heuristic for the Large-Scale Capacitated Vehicle Routing Problem pp. 974-986

Vinícius R. Máximo, Jean-François Cordeau and Mariá C. V. Nascimento

A Neural Separation Algorithm for the Rounded Capacity Inequalities pp. 987-1005

Hyeonah Kim, Jinkyoo Park and Changhyun Kwon

An Approximate Dynamic Programming Approach to Dynamic Stochastic Matching pp. 1006-1022

Fan You and Thomas Vossen

A Shrinkage Approach to Improve Direct Bootstrap Resampling Under Input Uncertainty pp. 1023-1039

Eunhye Song, Henry Lam and Russell R. Barton

Polyhedral Relaxations for Optimal Pump Scheduling of Potable Water Distribution Networks pp. 1040-1063

Byron Tasseff, Russell Bent, Carleton Coffrin, Clayton Barrows, Devon Sigler, Jonathan Stickel, Ahmed S. Zamzam, Yang Liu and Pascal Van Hentenryck

Decremental State-Space Relaxations for the Basic Traveling Salesman Problem with a Drone pp. 1064-1083

Marcos Blufstein, Gonzalo Lera-Romero and Francisco J. Soulignac

Exact and Heuristic Solution Techniques for Mixed-Integer Quantile Minimization Problems pp. 1084-1107

Diego Cattaruzza, Martine Labbé, Matteo Petris, Marius Roland and Martin Schmidt

A Dedicated Pricing Algorithm to Solve a Large Family of Nurse Scheduling Problems with Branch-and-Price pp. 1108-1128

Antoine Legrain and Jérémy Omer

Use of Machine Learning Models to Warmstart Column Generation for Unit Commitment pp. 1129-1146

Nagisa Sugishita, Andreas Grothey and Ken McKinnon

Volume 36, issue 3, 2024

Note from the Editor pp. 705-707

Alice E. Smith

Solving a Class of Cut-Generating Linear Programs via Machine Learning pp. 708-722

Atefeh Rajabalizadeh and Danial Davarnia

Iterative Rule Extension for Logic Analysis of Data: An MILP-Based Heuristic to Derive Interpretable Binary Classifiers from Large Data Sets pp. 723-741

Marleen Balvert

Product Redesign and Innovation Based on Online Reviews: A Multistage Combined Search Method pp. 742-765

Jindong Qin, Pan Zheng and Xiaojun Wang

Supervised ML for Solving the GI / GI /1 Queue pp. 766-786

Opher Baron, Dmitry Krass, Arik Senderovich and Eliran Sherzer

Largest Volume Inscribed Rectangles in Convex Sets Defined by Finite Number of Inequalities pp. 787-819

Mehdi Behroozi

Sparsity-Exploiting Distributed Projections onto a Simplex pp. 820-835

Yongzheng Dai and Chen Chen

Minimizing the Weighted Number of Tardy Jobs via (max,+)-Convolutions pp. 836-848

Danny Hermelin, Hendrik Molter and Dvir Shabtay

A Column Generation Scheme for Distributionally Robust Multi-Item Newsvendor Problems pp. 849-867

Shanshan Wang and Erick Delage

Efficient Propagation Techniques for Handling Cyclic Symmetries in Binary Programs pp. 868-883

Jasper van Doornmalen and Christopher Hojny

Solving Sparse Separable Bilinear Programs Using Lifted Bilinear Cover Inequalities pp. 884-899

Xiaoyi Gu, Santanu S. Dey and Jean-Philippe P. Richard

Approximate Kernel Learning Uncertainty Set for Robust Combinatorial Optimization pp. 900-917

Benoît Loger, Alexandre Dolgui, Fabien Lehuédé and Guillaume Massonnet

A Sequential Follower Refinement Algorithm for Robust Surgery Scheduling pp. 918-937

Ankit Bansal, Jean-Philippe Richard, Bjorn P. Berg and Yu-Li Huang

Volume 36, issue 2, 2024

Note from the Editor pp. 305-307

Alice E. Smith

Heuristic Search for Rank Aggregation with Application to Label Ranking pp. 308-326

Yangming Zhou, Jin-Kao Hao and Zhen Li

BilevelJuMP.jl: Modeling and Solving Bilevel Optimization Problems in Julia pp. 327-335

Joaquim Dias Garcia, Guilherme Bodin and Alexandre Street

Seamless Multimodal Transportation Scheduling pp. 336-358

Arvind U. Raghunathan, David Bergman, John N. Hooker, Thiago Serra and Shingo Kobori

Group Equality in Adaptive Submodular Maximization pp. 359-376

Shaojie Tang and Jing Yuan

A Differentiable Path-Following Method with a Compact Formulation to Compute Proper Equilibria pp. 377-396

Yiyin Cao, Yin Chen and Chuangyin Dang

A Consensus-Based Alternating Direction Method for Mixed-Integer and PDE-Constrained Gas Transport Problems pp. 397-416

Richard Krug, Günter Leugering, Alexander Martin, Martin Schmidt and Dieter Weninger

On Solving MAX-SAT Using Sum of Squares pp. 417-433

Lennart Sinjorgo and Renata Sotirov

Combination Chemotherapy Optimization with Discrete Dosing pp. 434-455

Temitayo Ajayi, Seyedmohammadhossein Hosseinian, Andrew J. Schaefer and Clifton D. Fuller

Flexible Differentiable Optimization via Model Transformations pp. 456-478

Mathieu Besançon, Joaquim Dias Garcia, Benoît Legat and Akshay Sharma

An Exact Method for (Constrained) Assortment Optimization Problems with Product Costs pp. 479-494

Markus Leitner, Andrea Lodi, Roberto Roberti and Claudio Sole

Bayesian Network Models for PTSD Screening in Veterans pp. 495-509

Yi Tan, Prakash P. Shenoy, Ben Sherwood, Catherine Shenoy, Melinda Gaddy and Mary E. Oehlert

Evolutionary Algorithm on General Cover with Theoretically Guaranteed Approximation Ratio pp. 510-525

Yaoyao Zhang, Chaojie Zhu, Shaojie Tang, Yingli Ran, Ding-Zhu Du and Zhao Zhang

A Decision Rule Approach for Two-Stage Data-Driven Distributionally Robust Optimization Problems with Random Recourse pp. 526-542

Xiangyi Fan and Grani A. Hanasusanto

A Decomposition Method for the Group-Based Quay Crane Scheduling Problem pp. 543-570

Defeng Sun, Lixin Tang, Roberto Baldacci and Zihan Chen

Deterring the Gray Market: Product Diversion Detection via Learning Disentangled Representations of Multivariate Time Series pp. 571-586

Hao Lin, Guannan Liu, Junjie Wu and J. Leon Zhao

Ensemble Variance Reduction Methods for Stochastic Mixed-Integer Programming and their Application to the Stochastic Facility Location Problem pp. 587-599

Jiajun Xu and Suvrajeet Sen

I nfrastructure M odels: Composable Multi-infrastructure Optimization in Julia pp. 600-615

Russell Bent, Byron Tasseff and Carleton Coffrin

A Deep Learning and Image Processing Pipeline for Object Characterization in Firm Operations pp. 616-634

Alireza Aghasi, Arun Rai and Yusen Xia

Stabilizing Grand Cooperation via Cost Adjustment: An Inverse Optimization Approach pp. 635-656

Lindong Liu, Xiangtong Qi and Zhou Xu

The Descent–Ascent Algorithm for DC Programming pp. 657-671

Pietro D’Alessandro, Manlio Gaudioso, Giovanni Giallombardo and Giovanna Miglionico

Correlation Clustering Problem Under Mediation pp. 672-689

Zacharie Ales, Céline Engelbeen and Rosa Figueiredo

An Efficient Global Optimal Method for Cardinality Constrained Portfolio Optimization pp. 690-704

Wei Xu, Jie Tang, Ka Fai Cedric Yiu and Jian Wen Peng