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 33, issue 4, 2021

Note from the Editor pp. 1259-1261

Alice E. Smith

SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning pp. 1262-1276

Frank de Meijer and Renata Sotirov

frvcpy: An Open-Source Solver for the Fixed Route Vehicle Charging Problem pp. 1277-1283

Nicholas D. Kullman, Aurelien Froger, Jorge E. Mendoza and Justin C. Goodson

Approximation Methods for Multiobjective Optimization Problems: A Survey pp. 1284-1299

Arne Herzel, Stefan Ruzika and Clemens Thielen

Decomposing Loosely Coupled Mixed-Integer Programs for Optimal Microgrid Design pp. 1300-1319

Alexander J. Zolan, Michael S. Scioletti, David P. Morton and Alexandra M. Newman

Characterizing Social TV Activity Around Televised Events: A Joint Topic Model Approach pp. 1320-1338

Yuheng Hu

Near-Linear Time Local Polynomial Nonparametric Estimation with Box Kernels pp. 1339-1353

Yining Wang, Yi Wu and Simon S. Du

Multivariable Branching: A 0-1 Knapsack Problem Case Study pp. 1354-1367

Yu Yang, Natashia Boland and Martin Savelsbergh

A New Global Optimization Scheme for Quadratic Programs with Low-Rank Nonconvexity pp. 1368-1383

Xiaoli Cen and Yong Xia

Improved Computational Approaches and Heuristics for Zero Forcing pp. 1384-1399

Boris Brimkov, Derek Mikesell and Illya V. Hicks

Unifying Online and Offline Preference for Social Link Prediction pp. 1400-1418

Fan Zhou, Kunpeng Zhang, Bangying Wu, Yi Yang and Harry Jiannan Wang

Exact Facetial Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization pp. 1419-1430

Michael Jünger and Sven Mallach

Exact Algorithms for the Minimum Load Spanning Tree Problem pp. 1431-1445

Xiaojun Zhu and Shaojie Tang

A Branch-and-Bound Algorithm for Building Optimal Data Gathering Tree in Wireless Sensor Networks pp. 1446-1460

Xiaojun Zhu and Shaojie Tang

Integer Programming Formulations for Minimum Spanning Tree Interdiction pp. 1461-1480

Ningji Wei, Jose L. Walteros and Foad Mahdavi Pajouh

Fortification Against Cascade Propagation Under Uncertainty pp. 1481-1499

Colin P. Gillen, Alexander Veremyev, Oleg A. Prokopyev and Eduardo L. Pasiliao

Ranking and Selection with Covariates for Personalized Decision Making pp. 1500-1519

Haihui Shen, L. Jeff Hong and Xiaowei Zhang

Computing Sensitivities for Distortion Risk Measures pp. 1520-1532

Peter W. Glynn, Yijie Peng, Michael C. Fu and Jian-Qiang Hu

Robust Capacity Planning for Project Management pp. 1533-1550

Antonio J. Conejo, Nicholas G. Hall, Daniel Zhuoyu Long and Runhao Zhang

Logic-Based Benders Decomposition and Binary Decision Diagram Based Approaches for Stochastic Distributed Operating Room Scheduling pp. 1551-1569

Cheng Guo, Merve Bodur, Dionne M. Aleman and David R. Urbach

Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets pp. 1570-1589

Juan S. Borrero and Leonardo Lozano

Structured Robust Submodular Maximization: Offline and Online Algorithms pp. 1590-1607

Alfredo Torrico, Mohit Singh, Sebastian Pokutta, Nika Haghtalab, Joseph (Seffi) Naor and Nima Anari

Location-Aware Real-Time Recommender Systems for Brick-and-Mortar Retailers pp. 1608-1623

Daniel Zeng, Yong Liu, Ping Yan and Yanwu Yang

Multirow Intersection Cuts Based on the Infinity Norm pp. 1624-1643

Álinson S. Xavier, Ricardo Fukasawa and Laurent Poirrier

Bilevel Integer Programs with Stochastic Right-Hand Sides pp. 1644-1660

Junlong Zhang and Osman Y. Özaltın

Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning pp. 1661-1677

Shanshan Wang, Jinlin Li and Sanjay Mehrotra

Volume 33, issue 3, 2021

Note from the Editor pp. 837-838

Alice E. Smith

3-D Dynamic UAV Base Station Location Problem pp. 839-860

Cihan Tugrul Cicek, Zuo-Jun Max Shen, Hakan Gultekin and Bulent Tavli

Robust Models for the Kidney Exchange Problem pp. 861-881

Margarida Carvalho, Xenia Klimentova, Kristiaan Glorie, Ana Viana and Miguel Constantino

Tagging Items Automatically Based on Both Content Information and Browsing Behaviors pp. 882-897

Shen Liu and Hongyan Liu

Multicomponent Maintenance Optimization: A Stochastic Programming Approach pp. 898-914

Zhicheng Zhu, Yisha Xiang and Bo Zeng

Rapid Discrete Optimization via Simulation with Gaussian Markov Random Fields pp. 915-930

Mark Semelhago, Barry L. Nelson, Eunhye Song and Andreas Wächter

The Risk-Averse Static Stochastic Knapsack Problem pp. 931-948

Yasemin Merzifonluoglu and Joseph Geunes

The Quadratic Multiknapsack Problem with Conflicts and Balance Constraints pp. 949-962

Philippe Olivier, Andrea Lodi and Gilles Pesant

Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem pp. 963-978

Jean-François Côté, Mohamed Haouari and Manuel Iori

The Rank-One Quadratic Assignment Problem pp. 979-996

Yang Wang, Wei Yang, Abraham P. Punnen, Jingbo Tian, Aihua Yin and Zhipeng Lü

Time-Dependent Shortest Path Problems with Penalties and Limits on Waiting pp. 997-1014

Edward He, Natashia Boland, George Nemhauser and Martin Savelsbergh

A Framework for Solving Chance-Constrained Linear Matrix Inequality Programs pp. 1015-1036

Roya Karimi, Jianqiang Cheng and Miguel Lejeune

Extreme Ray Feasibility Cuts for Unit Commitment with Uncertainty pp. 1037-1055

Chao Li, Muhong Zhang and Kory Hedman

An Augmented Lagrangian Decomposition Method for Chance-Constrained Optimization Problems pp. 1056-1069

Xiaodi Bai, Jie Sun and Xiaojin Zheng

A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques pp. 1070-1090

Timo Gschwind, Stefan Irnich, Fabio Furini and Roberto Wolfler Calvo

An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints pp. 1091-1102

Wenda Zhang, Jason J. Sauppe and Sheldon H. Jacobson

Mixed-Integer Convex Nonlinear Optimization with Gradient-Boosted Trees Embedded pp. 1103-1119

Miten Mistry, Dimitrios Letsios, Gerhard Krennrich, Robert M. Lee and Ruth Misener

Data-Driven Optimization of Reward-Risk Ratio Measures pp. 1120-1137

Ran Ji and Miguel Lejeune

Linearized Robust Counterparts of Two-Stage Robust Optimization Problems with Applications in Operations Management pp. 1138-1161

Amir Ardestani-Jaafari and Erick Delage

A Branch-and-Bound Algorithm for Team Formation on Social Networks pp. 1162-1176

Nihal Berktaş and Hande Yaman

Knowledge Learning of Insurance Risks Using Dependence Models pp. 1177-1196

Zifeng Zhao, Peng Shi and Xiaoping Feng

A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints pp. 1197-1212

Zeyang Wu, Kameng Nip and Qie He

An Exact Algorithm for Large-Scale Continuous Nonlinear Resource Allocation Problems with Minimax Regret Objectives pp. 1213-1228

Jungho Park, Hadi El-Amine and Nevin Mutlu

Multiproduct Newsvendor Problem with Customer-Driven Demand Substitution: A Stochastic Integer Program Perspective pp. 1229-1244

Jie Zhang, Weijun Xie and Subhash C. Sarin

Modeling and Solving the Intersection Inspection Rural Postman Problem pp. 1245-1257

Debdatta Sinha Roy, Adriano Masone, Bruce Golden and Edward Wasil

Volume 33, issue 2, 2021

Note from the Editor pp. 419-420

Alice E. Smith

Conflict Analysis for MINLP pp. 421-435

Timo Berthold and Jakob Witzig

Modeling Single-Picker Routing Problems in Classical and Modern Warehouses pp. 436-451

Dominik Goeke and Michael Schneider

A Branch-and-Price-and-Cut Algorithm for the Cable-Routing Problem in Solar Power Plants pp. 452-476

Zhixing Luo, Hu Qin, T. C. E. Cheng, Qinghua Wu and Andrew Lim

Vehicle Sequencing at Transshipment Terminals with Handover Relations pp. 477-494

Dirk Briskorn, Malte Fliedner and Martin Tschöke

Addressing Orientation Symmetry in the Time Window Assignment Vehicle Routing Problem pp. 495-510

Kevin Dalmeijer and Guy Desaulniers

Sparse Solutions by a Quadratically Constrained ℓ q (0 < q < 1) Minimization Model pp. 511-530

Shan Jiang, Shu-Cherng Fang and Qingwei Jin

On the Solution of ℓ 0 -Constrained Sparse Inverse Covariance Estimation Problems pp. 531-550

Dzung T. Phan and Matt Menickelly

A Mixed-Integer Fractional Optimization Approach to Best Subset Selection pp. 551-565

Andrés Gómez and Oleg A. Prokopyev

Supervised t -Distributed Stochastic Neighbor Embedding for Data Visualization and Classification pp. 566-585

Yichen Cheng, Xinlei Wang and Yusen Xia

Data-Driven Preference Learning Methods for Value-Driven Multiple Criteria Sorting with Interacting Criteria pp. 586-606

Jiapeng Liu, Miłosz Kadziński, Xiuwu Liao and Xiaoxin Mao

Semidefinite Programming and Nash Equilibria in Bimatrix Games pp. 607-628

Amir Ali Ahmadi and Jeffrey Zhang

A New Scatter Search Design for Multiobjective Combinatorial Optimization with an Application to Facility Location pp. 629-642

A. D. López-Sánchez, J. Sánchez-Oro and M. Laguna

A Learning-Based Matheuristic for Stochastic Multicommodity Network Design pp. 643-656

Fatemeh Sarayloo, Teodor Gabriel Crainic and Walter Rei

Selecting the Best Alternative Based on Its Quantile pp. 657-671

Demet Batur and F. Fred Choobineh

Reducing Simulation Input-Model Risk via Input Model Averaging pp. 672-684

Barry L. Nelson, Alan T. K. Wan, Guohua Zou, Xinyu Zhang and Xi Jiang

Lagrangian Duality for Robust Problems with Decomposable Functions: The Case of a Robust Inventory Problem pp. 685-705

Filipe Rodrigues, Agostinho Agra, Cristina Requejo and Erick Delage

Conflict-Driven Heuristics for Mixed Integer Programming pp. 706-720

Jakob Witzig and Ambros Gleixner

Exact Multiple Sequence Alignment by Synchronized Decision Diagrams pp. 721-738

Amin Hosseininasab and Willem-Jan van Hoeve

Learning to Solve Large-Scale Security-Constrained Unit Commitment Problems pp. 739-756

Álinson S. Xavier, Feng Qiu and Shabbir Ahmed

Scenario Grouping and Decomposition Algorithms for Chance-Constrained Programs pp. 757-773

Yan Deng, Huiwen Jia, Shabbir Ahmed, Jon Lee and Siqian Shen

Breaking the r max Barrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem pp. 774-784

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

Monge Properties, Optimal Greedy Policies, and Policy Improvement for the Dynamic Stochastic Transportation Problem pp. 785-807

Alexander S. Estes and Michael O. Ball

A Multistage Stochastic Programming Approach to the Optimal Surveillance and Control of the Emerald Ash Borer in Cities pp. 808-834

Eyyüb Y. Kıbış, İ. Esra Büyüktahtakın, Robert G. Haight, Najmaddin Akhundov, Kathleen Knight and Charles E. Flower

Corrigendum to “A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems,” INFORMS Journal on Computing 28(1):14–30, 2016 pp. 835-835

Natashia Boland, Riley Clement and Hamish Waterer

Volume 33, issue 1, 2021

Note from the Editor pp. 1

Alice E. Smith

Approximate Dynamic Programming for Military Medical Evacuation Dispatching Policies pp. 2-26

Phillip R. Jenkins, Matthew J. Robbins and Brian J. Lunday

SDDP.jl: A Julia Package for Stochastic Dual Dynamic Programming pp. 27-33

Oscar Dowson and Lea Kapelevich

High-Performance Prototyping of Decomposition Methods in GAMS pp. 34-50

Timo Lohmann, Michael R. Bussieck, Lutz Westermann and Steffen Rebennack

Stochastic Decomposition for Two-Stage Stochastic Linear Programs with Random Cost Coefficients pp. 51-71

Harsha Gangammanavar, Yifan Liu and Suvrajeet Sen

Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems pp. 72-85

Satya Tamby and Daniel Vanderpooten

A Branch-and-Price Algorithm for Facility Location with General Facility Cost Functions pp. 86-104

Wenjun Ni, Jia Shu, Miao Song, Dachuan Xu and Kaike Zhang

Polyhedral Results and Branch-and-Cut for the Resource Loading Problem pp. 105-119

Guopeng Song, Tamás Kis and Roel Leus

Optimization for L 1 -Norm Error Fitting via Data Aggregation pp. 120-142

Young Woong Park

Exploiting the Structure of Two-Stage Robust Optimization Models with Exponential Scenarios pp. 143-162

Hossein Hashemi Doulabi, Patrick Jaillet, Gilles Pesant and Louis-Martin Rousseau

Perspective Reformulations of Semicontinuous Quadratically Constrained Quadratic Programs pp. 163-179

Xiaojin Zheng, Yutong Pan and Zhaolin Hu

Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties pp. 180-197

Hezhi Luo, Xiaodong Ding, Jiming Peng, Rujun Jiang and Duan Li

Computing Feasible Points of Bilevel Problems with a Penalty Alternating Direction Method pp. 198-215

Thomas Kleinert and Martin Schmidt

A Computational Approach to First Passage Problems of Reflected Hyperexponential Jump Diffusion Processes pp. 216-229

Ning Cai and Xuewei Yang

Efficient Sampling Allocation Procedures for Optimal Quantile Selection pp. 230-245

Yijie Peng, Chun-Hung Chen, Michael C. Fu, Jian-Qiang Hu and Ilya O. Ryzhov

Calibration of Voting-Based Helpfulness Measurement for Online Reviews: An Iterative Bayesian Probability Approach pp. 246-261

Xunhua Guo, Guoqing Chen, Cong Wang, Qiang Wei and Zunqiang Zhang

Sparse Convex Regression pp. 262-279

Dimitris Bertsimas and Nishanth Mundru

A Review Selection Method for Finding an Informative Subset from Online Reviews pp. 280-299

Jin Zhang, Cong Wang and Guoqing Chen

Integrating Individual and Aggregate Diversity in Top- N Recommendation pp. 300-318

Ethem Çanakoğlu, İbrahim Muter and Tevfik Aytekin

The Migratory Beekeeping Routing Problem: Model and an Exact Algorithm pp. 319-335

Zu-Jun Ma, Fei Yang, Ying Dai and Zuo-Jun Max Shen

Robust Optimization for Electricity Generation pp. 336-351

Haoxiang Yang, David P. Morton, Chaithanya Bandi and Krishnamurthy Dvijotham

Multistage Stochastic Power Generation Scheduling Co-Optimizing Energy and Ancillary Services pp. 352-369

Jianqiu Huang, Kai Pan and Yongpei Guan

Worst-Case Expected Shortfall with Univariate and Bivariate Marginals pp. 370-389

Anulekha Dhara, Bikramjit Das and Karthik Natarajan

Piecewise Constant Decision Rules via Branch-and-Bound Based Scenario Detection for Integer Adjustable Robust Optimization pp. 390-400

Ward Romeijnders and Krzysztof Postek

Decision Diagram Decomposition for Quadratically Constrained Binary Optimization pp. 401-418

David Bergman and Leonardo Lozano