Journal: INFORMS Journal on Computing

Volume 32, Issue 4

855 -- 856Alice E. Smith. Note from the Editor
857 -- 876Bernard Knueven, James Ostrowski, Jean-Paul Watson. On Mixed-Integer Programming Formulations for the Unit Commitment Problem
877 -- 894Vishal Ahuja, John R. Birge. An Approximation Approach for Response-Adaptive Clinical Trial Design
895 -- 911Hrayer Aprahamian, Douglas R. Bish, Ebru K. Bish. Optimal Group Testing: Structural Properties and Robust Solutions, with Application to Public Health Screening
912 -- 929Sean L. Barnes, Miranda Myers, Clare Rock, Daniel J. Morgan, Lisa Pineles, Kerri A. Thom, Anthony D. Harris. Evaluating a Prediction-Driven Targeting Strategy for Reducing the Transmission of Multidrug-Resistant Organisms
930 -- 951Ali Ajdari, Fatemeh Saberian, Archis Ghate. A Theoretical Framework for Learning Tumor Dose-Response Uncertainty in Individualized Spatiobiologically Integrated Radiotherapy
952 -- 967Hamidreza Validi, Austin Buchanan. The Optimal Design of Low-Latency Virtual Backbones
968 -- 985Geunyeong Byeon, Pascal Van Hentenryck, Russell Bent, Harsha Nagarajan. Communication-Constrained Expansion Planning for Resilient Distribution Systems
986 -- 995Zdravko I. Botev, Pierre L'Ecuyer. Sampling Conditionally on a Rare Event via Generalized Splitting
996 -- 1011Qiudan Li, Daniel Dajun Zeng, David Jingjun Xu, Ruoran Liu, Riheng Yao. Understanding and Predicting Users' Rating Behavior: A Cognitive Perspective
1012 -- 1029Feng Li 0024, Zhou Xu 0001, Zhi-Long Chen. Production and Transportation Integration for Commit-to-Delivery Mode with General Shipping Costs
1030 -- 1048Francesco Carrabs, Carmine Cerrone, Raffaele Cerulli, Bruce L. Golden. An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for the Close-Enough Traveling Salesman Problem
1049 -- 1060Maurizio Boccia, Antonio Sforza, Claudio Sterle. Simple Pattern Minimality Problems: Integer Linear Programming Formulations and Covering-Based Heuristic Solving Approaches
1061 -- 1079Renata Mansini, Roberto Zanotti. A Core-Based Exact Algorithm for the Multidimensional Multiple Choice Knapsack Problem
1080 -- 1100Kyle Cooper, Susan R. Hunter, Kalyani Nagaraj. Biobjective Simulation Optimization on Integer Lattices Using the Epsilon-Constraint Method in a Retrospective Approximation Framework
1101 -- 1108Kyle Cooper, Susan R. Hunter. PyMOSO: Software for Multiobjective Simulation Optimization with R-PERLE and R-MinRLE
1109 -- 1127Ernst Roos, Dick den Hertog. Reducing Conservatism in Robust Optimization
1128 -- 1142Bo Zeng 0001. A Practical Scheme to Compute the Pessimistic Bilevel Optimization Problem
1143 -- 1156Juheng Zhang, Xiaoping Liu, Xiao-Bai Li. Predictive Analytics with Strategically Missing Data
1157 -- 1181Nir Halman. Provably Near-Optimal Approximation Schemes for Implicit Stochastic and Sample-Based Dynamic Programs

Volume 32, Issue 3

531 -- 546Lingxun Kong, Christos T. Maravelias. On the Derivation of Continuous Piecewise Linear Approximating Functions
547 -- 564Zheng Zhang, Brian T. Denton, Xiaolan Xie. Branch and Price for Chance-Constrained Bin Packing
565 -- 581Joshua Q. Hale, Helin Zhu, Enlu Zhou. Domination Measure: A New Metric for Solving Multiobjective Optimization
582 -- 599Samuel Deleplanque, Martine Labbé, Diego Ponce, Justo Puerto. A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem
600 -- 619Young Woong Park. MILP Models for Complex System Reliability Redundancy Allocation with Mixed Components
620 -- 640Shuming Wang, Yan-fu Li. Distributionally Robust Design for Redundancy Allocation
641 -- 660Hoda Atef Yekta, Robert Day. Optimization-based Mechanisms for the Course Allocation Problem
661 -- 681Anirudh Subramanyam, Panagiotis P. Repoussis, Chrysanthos E. Gounaris. Robust Optimization of a Broad Class of Heterogeneous Vehicle Routing Problems Under Demand Uncertainty
682 -- 696Ksenia Bestuzheva, Hassan L. Hijazi, Carleton Coffrin. Convex Relaxations for Quadratic On/Off Constraints and Applications to Optimal Transmission Switching
697 -- 713Shixuan Zhang, Sheng Liu 0006, Tianhu Deng, Zuo-Jun Max Shen. Transient-State Natural Gas Transmission in Gunbarrel Pipeline Networks
714 -- 729Fan Zhou 0002, Kunpeng Zhang, Shuying Xie, Xucheng Luo. Learning to Correlate Accounts Across Online Social Networks: An Embedding-Based Approach
730 -- 746Vladyslav Sokol, Ante Custic, Abraham P. Punnen, Binay Bhattacharya. Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms
747 -- 762Seyedmohammadhossein Hosseinian, Dalila B. M. M. Fontes, Sergiy Butenko. A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem
763 -- 778Zhuqi Miao, Balabhaskar Balasundaram. An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph
779 -- 789Yaqin Zhou, ShaoJie Tang. Differentially Private Distributed Learning
790 -- 804Kai Han, Yuntian He, Alex X. Liu, ShaoJie Tang, He Huang 0001. Differentially Private and Budget-Limited Bandit Learning over Matroids
805 -- 821Kevin Ryan, Shabbir Ahmed 0001, Santanu S. Dey, Deepak Rajan, Amelia Musselman, Jean-Paul Watson. Optimization-Driven Scenario Grouping
822 -- 834Egon Balas, Thiago Serra. When Lift-and-Project Cuts Are Different
835 -- 853Nan Liu 0004, Yuhang Ma, Huseyin Topaloglu. Assortment Optimization Under the Multinomial Logit Model with Sequential Offerings

Volume 32, Issue 2

199 -- 200Alice E. Smith. Note from the Editor
201 -- 218Areesh Mittal, Can Gokalp, Grani A. Hanasusanto. Robust Quadratic Programming with Mixed-Integer Uncertainty
219 -- 233Hao Hu, Renata Sotirov. On Solving the Quadratic Shortest Path Problem
234 -- 248Sepehr Nemati, Zeynep G. Icten, Lisa M. Maillart, Andrew J. Schaefer. Mitigating Information Asymmetry in Liver Allocation
249 -- 262Stefan Poikonen, Bruce L. Golden. The Mothership and Drone Routing Problem
263 -- 278Margarita P. Castro, André Augusto Ciré, J. Christopher Beck. An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP
279 -- 288Gerald G. Brown, W. Matthew Carlyle. Solving the Nearly Symmetric All-Pairs Shortest-Path Problem
289 -- 302Dilek Günneç, S. Raghavan 0001, Rui Zhang 0025. Least-Cost Influence Maximization on Social Networks
303 -- 320Xiaoye Cheng, Jingjing Zhang 0001, Lu (LUCY) Yan. Understanding the Impact of Individual Users' Rating Characteristics on the Predictive Accuracy of Recommender Systems
321 -- 345Zhiling Guo, Jin Li, Ram Ramesh. Scalable, Adaptable, and Fast Estimation of Transient Downtime in Virtual Infrastructures Using Convex Decomposition and Sample Path Randomization
346 -- 355Alper Atamtürk, Carlos Deck, Hyemin Jeon. Successive Quadratic Upper-Bounding for Discrete Mean-Risk Minimization and Network Interdiction
356 -- 375Guangxin Jiang, L. Jeff Hong, Barry L. Nelson. Online Risk Monitoring Using Offline Simulation
376 -- 389Nanjing Jian, Shane G. Henderson. Estimating the Probability that a Function Observed with Noise Is Convex
390 -- 407Zhenyu Cui, Michael C. Fu 0001, Jian-Qiang Hu, Yanchu Liu, Yijie Peng, Lingjiong Zhu. On the Variance of Single-Run Unbiased Stochastic Derivative Estimators
408 -- 427Dimitris Bertsimas, Iain Dunning. Relative Robust and Adaptive Optimization
428 -- 443Lijun Wei, Zhixing Luo, Roberto Baldacci, Andrew Lim. A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems
444 -- 460Raphael Kramer, Manuel Iori, Thibaut Vidal. Mathematical Models and Search Algorithms for the Capacitated -Center Problem
461 -- 472William Pettersson, Melih Ozlen. Multiobjective Integer Programming: Synergistic Parallel Approaches
473 -- 506Tobias Achterberg, Robert E. Bixby, Zonghao Gu, Edward Rothberg, Dieter Weninger. Presolve Reductions in Mixed Integer Programming
507 -- 530Steffen Rebennack, Vitaliy Krasko. Piecewise Linear Function Fitting via Mixed-Integer Linear Programming

Volume 32, Issue 1

1 -- 2Alice E. Smith. Note from the Editor
3 -- 15Gerdus Benadè, John N. Hooker. Optimization Bounds from the Branching Dual
16 -- 39Tyler A. Perini, Natashia Boland, Diego Pecin, Martin W. P. Savelsbergh. A Criterion Space Method for Biobjective Mixed Integer Programming: The Boxed Line Method
40 -- 56Wei Xia, Juan-Carlos Vera 0001, Luis F. Zuluaga. Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques
57 -- 73Daniel Jornada, V. Jorge Leon. Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint
74 -- 89Qinghua Wu, Yang Wang 0030, Fred W. Glover. Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking
90 -- 100Daniel Oliveira, Artur Alves Pessoa. An Improved Branch-Cut-and-Price Algorithm for Parallel Machine Scheduling Problems
101 -- 119Maxence Delorme, Manuel Iori. Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
120 -- 134Okan Arslan, Ola Jabali, Gilbert Laporte. A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints
135 -- 144Pierre L'Ecuyer, Paul Wambergue, Erwan Bourceret. Spectral Analysis of the MIXMAX Random Number Generators
145 -- 163Ilke Bakir, Natashia Boland, Brian Dandurand, Alan L. Erera. Sampling Scenario Set Partition Dual Bounds for Multistage Stochastic Programs
164 -- 171Jietao Xie, Juan Wu. Recursive Calculation Model for a Special Multivariate Normal Probability of First-Order Stationary Sequence
172 -- 181Yves Mocquard, Bruno Sericola, Emmanuelle Anceaume. Probabilistic Analysis of Rumor-Spreading Time
182 -- 198Daehan Won, Hasan Manzour, Wanpracha Art Chaovalitwongse. Convex Optimization for Group Feature Selection in Networked Data