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 32, issue 4, 2020

Note from the Editor pp. 855-856

Alice E. Smith

On Mixed-Integer Programming Formulations for the Unit Commitment Problem pp. 857-876

Bernard Knueven, James Ostrowski and Jean-Paul Watson

An Approximation Approach for Response-Adaptive Clinical Trial Design pp. 877-894

Vishal Ahuja and John Birge

Optimal Group Testing: Structural Properties and Robust Solutions, with Application to Public Health Screening pp. 895-911

Hrayer Aprahamian, Douglas R. Bish and Ebru K. Bish

Evaluating a Prediction-Driven Targeting Strategy for Reducing the Transmission of Multidrug-Resistant Organisms pp. 912-929

Sean L. Barnes, Miranda Myers, Clare Rock, Daniel J. Morgan, Lisa Pineles, Kerri A. Thom and Anthony D. Harris

A Theoretical Framework for Learning Tumor Dose-Response Uncertainty in Individualized Spatiobiologically Integrated Radiotherapy pp. 930-951

Ali Ajdari, Fatemeh Saberian and Archis Ghate

The Optimal Design of Low-Latency Virtual Backbones pp. 952-967

Hamidreza Validi and Austin Buchanan

Communication-Constrained Expansion Planning for Resilient Distribution Systems pp. 968-985

Geunyeong Byeon, Pascal Van Hentenryck, Russell Bent and Harsha Nagarajan

Sampling Conditionally on a Rare Event via Generalized Splitting pp. 986-995

Zdravko I. Botev and Pierre L’Ecuyer

Understanding and Predicting Users’ Rating Behavior: A Cognitive Perspective pp. 996-1011

Qiudan Li, Daniel Dajun Zeng, David Jingjun Xu, Ruoran Liu and Riheng Yao

Production and Transportation Integration for Commit-to-Delivery Mode with General Shipping Costs pp. 1012-1029

Feng Li, Zhou Xu and Zhi-Long Chen

An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for the Close-Enough Traveling Salesman Problem pp. 1030-1048

Francesco Carrabs, Carmine Cerrone, Raffaele Cerulli and Bruce Golden

Simple Pattern Minimality Problems: Integer Linear Programming Formulations and Covering-Based Heuristic Solving Approaches pp. 1049-1060

Maurizio Boccia, Antonio Sforza and Claudio Sterle

A Core-Based Exact Algorithm for the Multidimensional Multiple Choice Knapsack Problem pp. 1061-1079

Renata Mansini and Roberto Zanotti

Biobjective Simulation Optimization on Integer Lattices Using the Epsilon-Constraint Method in a Retrospective Approximation Framework pp. 1080-1100

Kyle Cooper, Susan R. Hunter and Kalyani Nagaraj

PyMOSO: Software for Multiobjective Simulation Optimization with R-PERLE and R-MinRLE pp. 1101-1108

Kyle Cooper and Susan R. Hunter

Reducing Conservatism in Robust Optimization pp. 1109-1127

Ernst Roos and Dick den Hertog

A Practical Scheme to Compute the Pessimistic Bilevel Optimization Problem pp. 1128-1142

Bo Zeng

Predictive Analytics with Strategically Missing Data pp. 1143-1156

Juheng Zhang, Xiaoping Liu and Xiao-Bai Li

Provably Near-Optimal Approximation Schemes for Implicit Stochastic and Sample-Based Dynamic Programs pp. 1157-1181

Nir Halman

Volume 32, issue 3, 2020

On the Derivation of Continuous Piecewise Linear Approximating Functions pp. 531-546

Lingxun Kong and Christos T. Maravelias

Branch and Price for Chance-Constrained Bin Packing pp. 547-564

Zheng Zhang, Brian T. Denton and Xiaolan Xie

Domination Measure: A New Metric for Solving Multiobjective Optimization pp. 565-581

Joshua Q. Hale, Helin Zhu and Enlu Zhou

A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem pp. 582-599

Samuel Deleplanque, Martine Labbé, Diego Ponce and Justo Puerto

MILP Models for Complex System Reliability Redundancy Allocation with Mixed Components pp. 600-619

Young Woong Park

Distributionally Robust Design for Redundancy Allocation pp. 620-640

Shuming Wang, Yan-Fu Li and Tong Jia

Optimization-based Mechanisms for the Course Allocation Problem pp. 641-660

Hoda Atef Yekta and Robert Day

Robust Optimization of a Broad Class of Heterogeneous Vehicle Routing Problems Under Demand Uncertainty pp. 661-681

Anirudh Subramanyam, Panagiotis P. Repoussis and Chrysanthos E. Gounaris

Convex Relaxations for Quadratic On/Off Constraints and Applications to Optimal Transmission Switching pp. 682-696

Ksenia Bestuzheva, Hassan Hijazi and Carleton Coffrin

Transient-State Natural Gas Transmission in Gunbarrel Pipeline Networks pp. 697-713

Shixuan Zhang, Sheng Liu, Tianhu Deng and Zuo-Jun Max Shen

Learning to Correlate Accounts Across Online Social Networks: An Embedding-Based Approach pp. 714-729

Fan Zhou, Kunpeng Zhang, Shuying Xie and Xucheng Luo

Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms pp. 730-746

Vladyslav Sokol, Ante Ćustić, Abraham P. Punnen and Binay Bhattacharya

A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem pp. 747-762

Seyedmohammadhossein Hosseinian, Dalila B. M. M. Fontes and Sergiy Butenko

An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph pp. 763-778

Zhuqi Miao and Balabhaskar Balasundaram

Differentially Private Distributed Learning pp. 779-789

Yaqin Zhou and Shaojie Tang

Differentially Private and Budget-Limited Bandit Learning over Matroids pp. 790-804

Kai Han, Yuntian He, Alex X. Liu, Shaojie Tang and He Huang

Optimization-Driven Scenario Grouping pp. 805-821

Kevin Ryan, Shabbir Ahmed, Santanu S. Dey, Deepak Rajan, Amelia Musselman and Jean-Paul Watson

When Lift-and-Project Cuts Are Different pp. 822-834

Egon Balas and Thiago Serra

Assortment Optimization Under the Multinomial Logit Model with Sequential Offerings pp. 835-853

Nan Liu, Yuhang Ma and Huseyin Topaloglu

Volume 32, issue 2, 2020

Note from the Editor pp. 199-200

Alice E. Smith

Robust Quadratic Programming with Mixed-Integer Uncertainty pp. 201-218

Areesh Mittal, Can Gokalp and Grani A. Hanasusanto

On Solving the Quadratic Shortest Path Problem pp. 219-233

Hao Hu and Renata Sotirov

Mitigating Information Asymmetry in Liver Allocation pp. 234-248

Sepehr Nemati, Zeynep G. Icten, Lisa M. Maillart and Andrew J. Schaefer

The Mothership and Drone Routing Problem pp. 249-262

Stefan Poikonen and Bruce Golden

An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP pp. 263-278

Margarita P. Castro, Andre A. Cire and J. Christopher Beck

Solving the Nearly Symmetric All-Pairs Shortest-Path Problem pp. 279-288

Gerald G. Brown and W. Matthew Carlyle

Least-Cost Influence Maximization on Social Networks pp. 289-302

Dilek Günneç, S. Raghavan and Rui Zhanga

Understanding the Impact of Individual Users’ Rating Characteristics on the Predictive Accuracy of Recommender Systems pp. 303-320

Xiaoye Cheng, Jingjing Zhang and Lu (Lucy) Yan

Scalable, Adaptable, and Fast Estimation of Transient Downtime in Virtual Infrastructures Using Convex Decomposition and Sample Path Randomization pp. 321-345

Zhiling Guo, Jin Li and Ram Ramesh

Successive Quadratic Upper-Bounding for Discrete Mean-Risk Minimization and Network Interdiction pp. 346-355

Alper Atamtürk, Carlos Deck and Hyemin Jeon

Online Risk Monitoring Using Offline Simulation pp. 356-375

Guangxin Jiang, L. Jeff Hong and Barry L. Nelson

Estimating the Probability that a Function Observed with Noise Is Convex pp. 376-389

Nanjing Jian and Shane G. Henderson

On the Variance of Single-Run Unbiased Stochastic Derivative Estimators pp. 390-407

Zhenyu Cui, Michael C. Fu, Jian-Qiang Hu, Yanchu Liu, Yijie Peng and Lingjiong Zhu

Relative Robust and Adaptive Optimization pp. 408-427

Dimitris Bertsimas and Iain Dunning

A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems pp. 428-443

Lijun Wei, Zhixing Luo,, Roberto Baldacci and Andrew Lim

Mathematical Models and Search Algorithms for the Capacitated p -Center Problem pp. 444-460

Raphael Kramer, Manuel Iori and Thibaut Vidal

Multiobjective Integer Programming: Synergistic Parallel Approaches pp. 461-472

William Pettersson and Melih Ozlen

Presolve Reductions in Mixed Integer Programming pp. 473-506

Tobias Achterberg, Robert E. Bixby, Zonghao Gu, Edward Rothberg and Dieter Weninger

Piecewise Linear Function Fitting via Mixed-Integer Linear Programming pp. 507-530

Steffen Rebennack and Vitaliy Krasko

Volume 32, issue 1, 2020

Note from the Editor pp. 1-2

Alice E. Smith

Optimization Bounds from the Branching Dual pp. 3-15

Gerdus Benadè and John N. Hooker

A Criterion Space Method for Biobjective Mixed Integer Programming: The Boxed Line Method pp. 16-39

Tyler Perini, Natashia Boland, Diego Pecin and Martin Savelsbergh

Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques pp. 40-56

Wei Xia, Juan C. Vera and Luis F. Zuluaga

Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint pp. 57-73

Daniel Jornada and V. Jorge Leon

Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking pp. 74-89

Qinghua Wu, Yang Wang and Fred Glover

An Improved Branch-Cut-and-Price Algorithm for Parallel Machine Scheduling Problems pp. 90-100

Daniel Oliveira and Artur Pessoa

Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems pp. 101-119

Maxence Delorme and Manuel Iori

A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints pp. 120-134

Okan Arslan, Ola Jabali and Gilbert Laporte

Spectral Analysis of the MIXMAX Random Number Generators pp. 135-144

Pierre L’Ecuyer, Paul Wambergue and Erwan Bourceret

Sampling Scenario Set Partition Dual Bounds for Multistage Stochastic Programs pp. 145-163

Ilke Bakir, Natashia Boland, Brian Dandurand and Alan Erera

Recursive Calculation Model for a Special Multivariate Normal Probability of First-Order Stationary Sequence pp. 164-171

Jietao Xie and Juan Wu

Probabilistic Analysis of Rumor-Spreading Time pp. 172-181

Yves Mocquard, Bruno Sericola and Emmanuelle Anceaume

Convex Optimization for Group Feature Selection in Networked Data pp. 182-198

Daehan Won, Hasan Manzour and Wanpracha Chaovalitwongse