Content
July 2022, Volume 34, Issue 4
- 2271-2295 Decision Diagrams for Discrete Optimization: A Survey of Recent Advances
by Margarita P. Castro & Andre A. Cire & J. Christopher Beck - 2296-2312 A Scalable Lower Bound for the Worst-Case Relay Attack Problem on the Transmission Grid
by Emma S. Johnson & Santanu Subhas Dey - 2313-2331 Integral Column Generation for Set Partitioning Problems with Side Constraints
by Adil Tahir & Guy Desaulniers & Issmail El Hallaoui - 2332-2349 On Generating Lagrangian Cuts for Two-Stage Stochastic Integer Programs
by Rui Chen & James Luedtke - 2350-2367 Robust Simulation with Likelihood-Ratio Constrained Input Uncertainty
by Zhaolin Hu & L. Jeff Hong - 2368-2382 Reducing and Calibrating for Input Model Bias in Computer Simulation
by Lucy E. Morgan & Luke Rhodes-Leader & Russell R. Barton
May 2022, Volume 34, Issue 3
- 1305-1305 Note from the Editor
by Alice E. Smith - 1306-1308 Unforeseen Consequences of “Tabu” Choices—A Retrospective
by Fred W. Glover - 1309-1326 Solving the Distance-Based Critical Node Problem
by Hosseinali Salemi & Austin Buchanan - 1327-1344 Extended Graph Formulation for the Inequity Aversion Pricing Problem on Social Networks
by Sunil Chopra & Hyunwoo Park & Sangho Shim - 1345-1365 Rapid Influence Maximization on Social Networks: The Positive Influence Dominating Set Problem
by S. Raghavan & Rui Zhang - 1366-1386 A Nonconvex Optimization Approach to IMRT Planning with Dose–Volume Constraints
by Kelsey Maass & Minsun Kim & Aleksandr Aravkin - 1387-1402 On a Reduction for a Class of Resource Allocation Problems
by Martijn H. H. Schoot Uiterkamp & Marco E. T. Gerards & Johann L. Hurink - 1403-1418 An Interior-Point Differentiable Path-Following Method to Compute Stationary Equilibria in Stochastic Games
by Chuangyin Dang & P. Jean-Jacques Herings & Peixuan Li - 1419-1436 Learning-Based Branch-and-Price Algorithms for the Vehicle Routing Problem with Time Windows and Two-Dimensional Loading Constraints
by Xiangyi Zhang & Lu Chen & Michel Gendreau & André Langevin - 1437-1452 A General Framework for Approximating Min Sum Ordering Problems
by Felix Happach & Lisa Hellerstein & Thomas Lidbetter - 1453-1470 A Criterion Space Branch-and-Cut Algorithm for Mixed Integer Bilinear Maximum Multiplicative Programs
by Vahid Mahmoodian & Iman Dayarian & Payman Ghasemi Saghand & Yu Zhang & Hadi Charkhgard - 1471-1488 Inverse Mixed Integer Optimization: Polyhedral Insights and Trust Region Methods
by Merve Bodur & Timothy C. Y. Chan & Ian Yihang Zhu - 1489-1511 A Scalable Algorithm for Sparse Portfolio Selection
by Dimitris Bertsimas & Ryan Cory-Wright - 1512-1530 Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling
by Artur Alves Pessoa & Teobaldo Bulhões & Vitor Nesello & Anand Subramanian - 1531-1547 Building Load Control Using Distributionally Robust Chance-Constrained Programs with Right-Hand Side Uncertainty and the Risk-Adjustable Variants
by Yiling Zhang & Jin Dong - 1548-1564 A General Branch-and-Cut Framework for Rotating Workforce Scheduling
by Tristan Becker & Maximilian Schiffer & Grit Walther - 1565-1586 Unsupervised Learning for Human Mobility Behaviors
by Siyuan Liu & Shaojie Tang & Jiangchuan Zheng & Lionel M. Ni - 1587-1605 Efficient Algebraic Multigrid Methods for Multilevel Overlapping Coclustering of User-Item Relationships
by Haifeng Xu & Rasha F. Kashef & Hans De Sterck & Geoffrey Sanders - 1606-1625 On the Estimation of Discrete Choice Models to Capture Irrational Customer Behaviors
by Sanjay Dominik Jena & Andrea Lodi & Claudio Sole - 1626-1643 Causal Rule Sets for Identifying Subgroups with Enhanced Treatment Effects
by Tong Wang & Cynthia Rudin - 1644-1660 Improving Sales Forecasting Accuracy: A Tensor Factorization Approach with Demand Awareness
by Xuan Bi & Gediminas Adomavicius & William Li & Annie Qu - 1661-1680 Uncovering Characteristic Response Paths of a Population
by Yicheng Song & Nachiketa Sahoo & Shuba Srinivasan & Chrysanthos Dellarocas - 1681-1692 MAD Dispersion Measure Makes Extremal Queue Analysis Simple
by Wouter van Eekelen & Dick den Hertog & Johan S.H. van Leeuwaarden - 1693-1710 Algorithms for Queueing Systems with Reneging and Priorities Modeled as Quasi-Birth-Death Processes
by Amir Rastpour & Armann Ingolfsson & Burhaneddin Sandıkçı - 1711-1728 Posterior-Based Stopping Rules for Bayesian Ranking-and-Selection Procedures
by David J. Eckman & Shane G. Henderson - 1729-1748 Monte Carlo and Quasi–Monte Carlo Density Estimation via Conditioning
by Pierre L’Ecuyer & Florian Puchhammer & Amal Ben Abdellah - 1749-1767 Benders Subproblem Decomposition for Bilevel Problems with Convex Follower
by Geunyeong Byeon & Pascal Van Hentenryck - 1768-1794 Computationally Efficient Approximations for Distributionally Robust Optimization Under Moment and Wasserstein Ambiguity
by Meysam Cheramin & Jianqiang Cheng & Ruiwei Jiang & Kai Pan - 1795-1818 Risk-Averse Stochastic Programming vs. Adaptive Robust Optimization: A Virtual Power Plant Application
by Ricardo M. Lima & Antonio J. Conejo & Loïc Giraldi & Olivier Le Maître & Ibrahim Hoteit & Omar M. Knio - 1819-1840 Integrated Stochastic Optimal Self-Scheduling for Two-Settlement Electricity Markets
by Kai Pan & Yongpei Guan
March 2022, Volume 34, Issue 2
- 671-671 Note from the Editor
by Alice E. Smith - 672-689 MathOptInterface: A Data Structure for Mathematical Optimization Problems
by Benoît Legat & Oscar Dowson & Joaquim Dias Garcia & Miles Lubin - 690-709 Optimal Power Flow in Distribution Networks Under N – 1 Disruptions: A Multistage Stochastic Programming Approach
by Haoxiang Yang & Harsha Nagarajan - 710-728 Influence Maximization with Latency Requirements on Social Networks
by S. Raghavan & Rui Zhang - 729-751 Distributionally Robust Optimization Under a Decision-Dependent Ambiguity Set with Applications to Machine Scheduling and Humanitarian Logistics
by Nilay Noyan & Gábor Rudolf & Miguel Lejeune - 752-768 Practical Nonparametric Sampling Strategies for Quantile-Based Ordinal Optimization
by Dongwook Shin & Mark Broadie & Assaf Zeevi - 769-789 Iterative Prediction-and-Optimization for E-Logistics Distribution Network Design
by Junming Liu & Weiwei Chen & Jingyuan Yang & Hui Xiong & Can Chen - 790-806 SHEDR: An End-to-End Deep Neural Event Detection and Recommendation Framework for Hyperlocal News Using Social Media
by Yuheng Hu & Yili Hong - 807-816 JANOS: An Integrated Predictive and Prescriptive Modeling Framework
by David Bergman & Teng Huang & Philip Brooks & Andrea Lodi & Arvind U. Raghunathan - 817-833 A Fast Vertex Weighting-Based Local Search for Finding Minimum Connected Dominating Sets
by Xinyun Wu & Zhipeng Lü & Fred Glover - 834-856 Scalable Vertiport Hub Location Selection for Air Taxi Operations in a Metropolitan Region
by Liting Chen & Sebastian Wandelt & Weibin Dai & Xiaoqian Sun - 857-871 Decomposition-Based Approaches for a Class of Two-Stage Robust Binary Optimization Problems
by Ayşe N. Arslan & Boris Detienne - 872-889 On the Exact Solution of Prize-Collecting Steiner Tree Problems
by Daniel Rehfeldt & Thorsten Koch - 890-908 A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games
by Claudio Contardo & Jorge A. Sefair - 909-933 Branch-and-Bound for Biobjective Mixed-Integer Linear Programming
by Nathan Adelgren & Akshay Gupte - 934-952 Estimating the Size of Branch-and-Bound Trees
by Gregor Hendel & Daniel Anderson & Pierre Le Bodic & Marc E. Pfetsch - 953-973 Improving Column Generation for Vehicle Routing Problems via Random Coloring and Parallelization
by Miao Yu & Viswanath Nagarajan & Siqian Shen - 974-989 Iterative Deepening Dynamically Improved Bounds Bidirectional Search
by John A. Pavlik & Edward C. Sewell & Sheldon H. Jacobson - 990-1005 Network Models for Multiobjective Discrete Optimization
by David Bergman & Merve Bodur & Carlos Cardonha & Andre A. Cire - 1006-1023 Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming
by Stefano Coniglio & Stefano Gualandi - 1024-1041 Combining Polyhedral Approaches and Stochastic Dual Dynamic Integer Programming for Solving the Uncapacitated Lot-Sizing Problem Under Uncertainty
by Franco Quezada & Céline Gicquel & Safia Kedad-Sidhoum - 1042-1047 A Comparison of Two Mixed-Integer Linear Programs for Piecewise Linear Function Fitting
by John Alasdair Warwicker & Steffen Rebennack - 1048-1069 Novel Formulations and Logic-Based Benders Decomposition for the Integrated Parallel Machine Scheduling and Location Problem
by Yantong Li & Jean-François Côté & Leandro Callegari-Coelho & Peng Wu - 1070-1085 Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation
by Saharnaz Mehrani & Carlos Cardonha & David Bergman - 1086-1114 Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems
by Edward Yuhang He & Natashia Boland & George Nemhauser & Martin Savelsbergh - 1115-1125 An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix
by Riley Badenbroek & Etienne de Klerk - 1126-1140 A First-Order Optimization Algorithm for Statistical Learning with Hierarchical Sparsity Structure
by Dewei Zhang & Yin Liu & Sam Davanloo Tajbakhsh - 1141-1156 Stabilized Column Generation Via the Dynamic Separation of Aggregated Rows
by Luciano Costa & Claudio Contardo & Guy Desaulniers & Julian Yarkony - 1157-1175 Exact Branch-Price-and-Cut for a Hospital Therapist Scheduling Problem with Flexible Service Locations and Time-Dependent Location Capacity
by Alexander Jungwirth & Guy Desaulniers & Markus Frey & Rainer Kolisch - 1176-1190 Dynamic Programming for Response-Adaptive Dose-Finding Clinical Trials
by Amir Ali Nasrollahzadeh & Amin Khademi - 1191-1206 Recourse in Kidney Exchange Programs
by Bart Smeulders & Valentin Bartier & Yves Crama & Frits C. R. Spieksma - 1207-1223 Surgery Sequencing Coordination with Recovery Resource Constraints
by Miao Bai & Robert H. Storer & Gregory L. Tonkay - 1224-1239 Managing Advance Admission Requests for Obstetric Care
by Na Geng & Xiaolan Xie - 1240-1256 Scalable Optimization Methods for Incorporating Spatiotemporal Fractionation into Intensity-Modulated Radiotherapy Planning
by Ali Adibi & Ehsan Salari - 1257-1271 Toward Robust Monitoring of Malicious Outbreaks
by Shaojie Tang & Siyuan Liu & Xu Han & Yu Qiao - 1272-1290 Efficient Solution Methods for a General r -Interdiction Median Problem with Fortification
by Kaike Zhang & Xueping Li & Mingzhou Jin - 1291-1304 Periodic Event Scheduling for Automated Production Systems
by Christoph Helmberg & Tobias Hofmann & David Wenzel
January 2022, Volume 34, Issue 1
- 1-1 Note from the Editor
by Alice E. Smith - 2-3 Special Issue of INFORMS Journal on Computing —Scalable Reinforcement Learning Algorithms
by J. Paul Brooks & Ted Ralphs & Nicola Secomandi - 4-10 Spatiotemporal Data Set for Out-of-Hospital Cardiac Arrests
by Janiele E. S. C. Custodio & Miguel A. Lejeune - 11-19 Alfonso: Matlab Package for Nonsymmetric Conic Optimization
by Dávid Papp & Sercan Yıldız - 20-38 Performance Approximation for Time-Dependent Queues with Generally Distributed Abandonments
by Gregor Selinka & Raik Stolletz & Thomas I. Maindl - 39-54 Self-Learning Threshold-Based Load Balancing
by Diego Goldsztajn & Sem C. Borst & Johan S. H. van Leeuwaarden & Debankur Mukherjee & Philip A. Whiting - 55-75 Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments
by Matthias Bentert & René van Bevern & André Nichterlein & Rolf Niedermeier & Pavel V. Smirnov - 76-92 An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem
by Yannick Kergosien & Antoine Giret & Emmanuel Néron & Gaël Sauvanet - 93-112 The Star Degree Centrality Problem: A Decomposition Approach
by Mustafa C. Camur & Thomas Sharkey & Chrysafis Vogiatzis - 113-128 An Analytic Framework for Effective Public Health Program Design Using Correctional Facilities
by Ozgur M. Araz & Mayteé Cruz-Aponte & Fernando A. Wilson & Brock W. Hanisch & Ruth S. Margalit - 129-149 Integrated Multiresource Capacity Planning and Multitype Patient Scheduling
by Liping Zhou & Na Geng & Zhibin Jiang & Shan Jiang - 150-164 Optimal Screening of Populations with Heterogeneous Risk Profiles Under the Availability of Multiple Tests
by Hrayer Aprahamian & Hadi El-Amine - 165-182 Min-Max Optimal Design of Two-Armed Trials with Side Information
by Qiong Zhang & Amin Khademi & Yongjia Song - 183-195 A High-Fidelity Model to Predict Length of Stay in the Neonatal Intensive Care Unit
by Kanix Wang & Walid Hussain & John R. Birge & Michael D. Schreiber & Daniel Adelman - 196-210 Robust Optimization for Models with Uncertain Second-Order Cone and Semidefinite Programming Constraints
by Jianzhe Zhen & Frans J. C. T. de Ruiter & Ernst Roos & Dick den Hertog - 211-226 Extending the Scope of Robust Quadratic Optimization
by Ahmadreza Marandi & Aharon Ben-Tal & Dick den Hertog & Bertrand Melenberg - 227-242 Predicting Tactical Solutions to Operational Planning Problems Under Imperfect Information
by Eric Larsen & Sébastien Lachapelle & Yoshua Bengio & Emma Frejinger & Simon Lacoste-Julien & Andrea Lodi - 243-261 Radius of Robust Feasibility for Mixed-Integer Problems
by Frauke Liers & Lars Schewe & Johannes Thürauf - 262-280 Team Orienteering with Time-Varying Profit
by Qinxiao Yu & Yossiri Adulyasak & Louis-Martin Rousseau & Ning Zhu & Shoufeng Ma - 281-296 Exact and Approximation Algorithms for the Expanding Search Problem
by Ben Hermans & Roel Leus & Jannik Matuschke - 297-314 Integer Programming, Constraint Programming, and Hybrid Decomposition Approaches to Discretizable Distance Geometry Problems
by Moira MacNeil & Merve Bodur - 315-332 Solving the Type-2 Assembly Line Balancing with Setups Using Logic-Based Benders Decomposition
by Hassan Zohali & Bahman Naderi & Vahid Roshanaei - 333-353 The Value of Randomized Solutions in Mixed-Integer Distributionally Robust Optimization Problems
by Erick Delage & Ahmed Saif - 354-369 State-Variable Modeling for a Class of Two-Stage Stochastic Optimization Problems
by Hossein Hashemi Doulabi & Shabbir Ahmed & George Nemhauser - 370-384 Combinatorial Heuristics for Inventory Routing Problems
by Ziye Tang & Yang Jiao & R. Ravi - 385-406 Predictive Search for Capacitated Multi-Item Lot Sizing Problems
by Tao Wu - 407-426 A General Model and Efficient Algorithms for Reliable Facility Location Problem Under Uncertain Disruptions
by Yongzhen Li & Xueping Li & Jia Shu & Miao Song & Kaike Zhang - 427-439 Template-Based Minor Embedding for Adiabatic Quantum Optimization
by Thiago Serra & Teng Huang & Arvind U. Raghunathan & David Bergman - 440-462 Picker Routing in AGV-Assisted Order Picking Systems
by Maximilian Löffler & Nils Boysen & Michael Schneider - 463-480 Learning for Constrained Optimization: Identifying Optimal Active Constraint Sets
by Sidhant Misra & Line Roald & Yeesian Ng - 481-502 On Cluster-Aware Supervised Learning: Frameworks, Convergent Algorithms, and Applications
by Shutong Chen & Weijun Xie - 503-521 Improving Reliability Estimation for Individual Numeric Predictions: A Machine Learning Approach
by Gediminas Adomavicius & Yaqiong Wang - 522-540 Analyzing Firm Reports for Volatility Prediction: A Knowledge-Driven Text-Embedding Approach
by Yi Yang & Kunpeng Zhang & Yangyang Fan - 541-556 Detecting Product Adoption Intentions via Multiview Deep Learning
by Zhu Zhang & Xuan Wei & Xiaolong Zheng & Qiudan Li & Daniel Dajun Zeng - 557-568 Dynamic Sampling Allocation Under Finite Simulation Budget for Feasibility Determination
by Zhongshun Shi & Yijie Peng & Leyuan Shi & Chun-Hung Chen & Michael C. Fu - 569-585 A Multilevel Simulation Optimization Approach for Quantile Functions
by Songhao Wang & Szu Hui Ng & William Benjamin Haskell - 586-606 Speeding Up Paulson’s Procedure for Large-Scale Problems Using Parallel Computing
by Ying Zhong & Shaoxuan Liu & Jun Luo & L. Jeff Hong - 607-621 Statistical Tests for Cross-Validation of Kriging Models
by Jack P. C. Kleijnen & Wim C. M. van Beers - 622-637 Combined Global and Local Search for Optimization with Gaussian Process Models
by Qun Meng & Songhao Wang & Szu Hui Ng - 638-655 A New Likelihood Ratio Method for Training Artificial Neural Networks
by Yijie Peng & Li Xiao & Bernd Heidergott & L. Jeff Hong & Henry Lam - 656-669 The Maximum k -Colorable Subgraph Problem and Related Problems
by Olga Kuryatnikova & Renata Sotirov & Juan C. Vera
October 2021, Volume 33, Issue 4
- 1259-1261 Note from the Editor
by Alice E. Smith - 1262-1276 SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning
by Frank de Meijer & Renata Sotirov - 1277-1283 frvcpy: An Open-Source Solver for the Fixed Route Vehicle Charging Problem
by Nicholas D. Kullman & Aurelien Froger & Jorge E. Mendoza & Justin C. Goodson - 1284-1299 Approximation Methods for Multiobjective Optimization Problems: A Survey
by Arne Herzel & Stefan Ruzika & Clemens Thielen - 1300-1319 Decomposing Loosely Coupled Mixed-Integer Programs for Optimal Microgrid Design
by Alexander J. Zolan & Michael S. Scioletti & David P. Morton & Alexandra M. Newman - 1320-1338 Characterizing Social TV Activity Around Televised Events: A Joint Topic Model Approach
by Yuheng Hu - 1339-1353 Near-Linear Time Local Polynomial Nonparametric Estimation with Box Kernels
by Yining Wang & Yi Wu & Simon S. Du - 1354-1367 Multivariable Branching: A 0-1 Knapsack Problem Case Study
by Yu Yang & Natashia Boland & Martin Savelsbergh - 1368-1383 A New Global Optimization Scheme for Quadratic Programs with Low-Rank Nonconvexity
by Xiaoli Cen & Yong Xia - 1384-1399 Improved Computational Approaches and Heuristics for Zero Forcing
by Boris Brimkov & Derek Mikesell & Illya V. Hicks - 1400-1418 Unifying Online and Offline Preference for Social Link Prediction
by Fan Zhou & Kunpeng Zhang & Bangying Wu & Yi Yang & Harry Jiannan Wang - 1419-1430 Exact Facetial Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization
by Michael Jünger & Sven Mallach - 1431-1445 Exact Algorithms for the Minimum Load Spanning Tree Problem
by Xiaojun Zhu & Shaojie Tang - 1446-1460 A Branch-and-Bound Algorithm for Building Optimal Data Gathering Tree in Wireless Sensor Networks
by Xiaojun Zhu & Shaojie Tang - 1461-1480 Integer Programming Formulations for Minimum Spanning Tree Interdiction
by Ningji Wei & Jose L. Walteros & Foad Mahdavi Pajouh - 1481-1499 Fortification Against Cascade Propagation Under Uncertainty
by Colin P. Gillen & Alexander Veremyev & Oleg A. Prokopyev & Eduardo L. Pasiliao - 1500-1519 Ranking and Selection with Covariates for Personalized Decision Making
by Haihui Shen & L. Jeff Hong & Xiaowei Zhang - 1520-1532 Computing Sensitivities for Distortion Risk Measures
by Peter W. Glynn & Yijie Peng & Michael C. Fu & Jian-Qiang Hu - 1533-1550 Robust Capacity Planning for Project Management
by Antonio J. Conejo & Nicholas G. Hall & Daniel Zhuoyu Long & Runhao Zhang - 1551-1569 Logic-Based Benders Decomposition and Binary Decision Diagram Based Approaches for Stochastic Distributed Operating Room Scheduling
by Cheng Guo & Merve Bodur & Dionne M. Aleman & David R. Urbach - 1570-1589 Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets
by Juan S. Borrero & Leonardo Lozano - 1590-1607 Structured Robust Submodular Maximization: Offline and Online Algorithms
by Alfredo Torrico & Mohit Singh & Sebastian Pokutta & Nika Haghtalab & Joseph (Seffi) Naor & Nima Anari - 1608-1623 Location-Aware Real-Time Recommender Systems for Brick-and-Mortar Retailers
by Daniel Zeng & Yong Liu & Ping Yan & Yanwu Yang - 1624-1643 Multirow Intersection Cuts Based on the Infinity Norm
by Álinson S. Xavier & Ricardo Fukasawa & Laurent Poirrier - 1644-1660 Bilevel Integer Programs with Stochastic Right-Hand Sides
by Junlong Zhang & Osman Y. Özaltın - 1661-1677 Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning
by Shanshan Wang & Jinlin Li & Sanjay Mehrotra
July 2021, Volume 33, Issue 3
- 837-838 Note from the Editor
by Alice E. Smith - 839-860 3-D Dynamic UAV Base Station Location Problem
by Cihan Tugrul Cicek & Zuo-Jun Max Shen & Hakan Gultekin & Bulent Tavli - 861-881 Robust Models for the Kidney Exchange Problem
by Margarida Carvalho & Xenia Klimentova & Kristiaan Glorie & Ana Viana & Miguel Constantino - 882-897 Tagging Items Automatically Based on Both Content Information and Browsing Behaviors
by Shen Liu & Hongyan Liu - 898-914 Multicomponent Maintenance Optimization: A Stochastic Programming Approach
by Zhicheng Zhu & Yisha Xiang & Bo Zeng - 915-930 Rapid Discrete Optimization via Simulation with Gaussian Markov Random Fields
by Mark Semelhago & Barry L. Nelson & Eunhye Song & Andreas Wächter - 931-948 The Risk-Averse Static Stochastic Knapsack Problem
by Yasemin Merzifonluoglu & Joseph Geunes - 949-962 The Quadratic Multiknapsack Problem with Conflicts and Balance Constraints
by Philippe Olivier & Andrea Lodi & Gilles Pesant - 963-978 Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem
by Jean-François Côté & Mohamed Haouari & Manuel Iori - 979-996 The Rank-One Quadratic Assignment Problem
by Yang Wang & Wei Yang & Abraham P. Punnen & Jingbo Tian & Aihua Yin & Zhipeng Lü - 997-1014 Time-Dependent Shortest Path Problems with Penalties and Limits on Waiting
by Edward He & Natashia Boland & George Nemhauser & Martin Savelsbergh - 1015-1036 A Framework for Solving Chance-Constrained Linear Matrix Inequality Programs
by Roya Karimi & Jianqiang Cheng & Miguel A. Lejeune - 1037-1055 Extreme Ray Feasibility Cuts for Unit Commitment with Uncertainty
by Chao Li & Muhong Zhang & Kory Hedman - 1056-1069 An Augmented Lagrangian Decomposition Method for Chance-Constrained Optimization Problems
by Xiaodi Bai & Jie Sun & Xiaojin Zheng - 1070-1090 A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques
by Timo Gschwind & Stefan Irnich & Fabio Furini & Roberto Wolfler Calvo - 1091-1102 An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints
by Wenda Zhang & Jason J. Sauppe & Sheldon H. Jacobson - 1103-1119 Mixed-Integer Convex Nonlinear Optimization with Gradient-Boosted Trees Embedded
by Miten Mistry & Dimitrios Letsios & Gerhard Krennrich & Robert M. Lee & Ruth Misener - 1120-1137 Data-Driven Optimization of Reward-Risk Ratio Measures
by Ran Ji & Miguel A. Lejeune - 1138-1161 Linearized Robust Counterparts of Two-Stage Robust Optimization Problems with Applications in Operations Management
by Amir Ardestani-Jaafari & Erick Delage - 1162-1176 A Branch-and-Bound Algorithm for Team Formation on Social Networks
by Nihal Berktaş & Hande Yaman - 1177-1196 Knowledge Learning of Insurance Risks Using Dependence Models
by Zifeng Zhao & Peng Shi & Xiaoping Feng - 1197-1212 A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints
by Zeyang Wu & Kameng Nip & Qie He - 1213-1228 An Exact Algorithm for Large-Scale Continuous Nonlinear Resource Allocation Problems with Minimax Regret Objectives
by Jungho Park & Hadi El-Amine & Nevin Mutlu - 1229-1244 Multiproduct Newsvendor Problem with Customer-Driven Demand Substitution: A Stochastic Integer Program Perspective
by Jie Zhang & Weijun Xie & Subhash C. Sarin - 1245-1257 Modeling and Solving the Intersection Inspection Rural Postman Problem
by Debdatta Sinha Roy & Adriano Masone & Bruce Golden & Edward Wasil
May 2021, Volume 33, Issue 2
- 419-420 Note from the Editor
by Alice E. Smith - 421-435 Conflict Analysis for MINLP
by Timo Berthold & Jakob Witzig - 436-451 Modeling Single-Picker Routing Problems in Classical and Modern Warehouses
by Dominik Goeke & Michael Schneider - 452-476 A Branch-and-Price-and-Cut Algorithm for the Cable-Routing Problem in Solar Power Plants
by Zhixing Luo & Hu Qin & T. C. E. Cheng & Qinghua Wu & Andrew Lim - 477-494 Vehicle Sequencing at Transshipment Terminals with Handover Relations
by Dirk Briskorn & Malte Fliedner & Martin Tschöke - 495-510 Addressing Orientation Symmetry in the Time Window Assignment Vehicle Routing Problem
by Kevin Dalmeijer & Guy Desaulniers - 511-530 Sparse Solutions by a Quadratically Constrained ℓ q (0 < q < 1) Minimization Model
by Shan Jiang & Shu-Cherng Fang & Qingwei Jin - 531-550 On the Solution of ℓ 0 -Constrained Sparse Inverse Covariance Estimation Problems
by Dzung T. Phan & Matt Menickelly - 551-565 A Mixed-Integer Fractional Optimization Approach to Best Subset Selection
by Andrés Gómez & Oleg A. Prokopyev - 566-585 Supervised t -Distributed Stochastic Neighbor Embedding for Data Visualization and Classification
by Yichen Cheng & Xinlei Wang & Yusen Xia - 586-606 Data-Driven Preference Learning Methods for Value-Driven Multiple Criteria Sorting with Interacting Criteria
by Jiapeng Liu & Miłosz Kadziński & Xiuwu Liao & Xiaoxin Mao - 607-628 Semidefinite Programming and Nash Equilibria in Bimatrix Games
by Amir Ali Ahmadi & Jeffrey Zhang - 629-642 A New Scatter Search Design for Multiobjective Combinatorial Optimization with an Application to Facility Location
by A. D. López-Sánchez & J. Sánchez-Oro & M. Laguna - 643-656 A Learning-Based Matheuristic for Stochastic Multicommodity Network Design
by Fatemeh Sarayloo & Teodor Gabriel Crainic & Walter Rei - 657-671 Selecting the Best Alternative Based on Its Quantile
by Demet Batur & F. Fred Choobineh - 672-684 Reducing Simulation Input-Model Risk via Input Model Averaging
by Barry L. Nelson & Alan T. K. Wan & Guohua Zou & Xinyu Zhang & Xi Jiang - 685-705 Lagrangian Duality for Robust Problems with Decomposable Functions: The Case of a Robust Inventory Problem
by Filipe Rodrigues & Agostinho Agra & Cristina Requejo & Erick Delage - 706-720 Conflict-Driven Heuristics for Mixed Integer Programming
by Jakob Witzig & Ambros Gleixner - 721-738 Exact Multiple Sequence Alignment by Synchronized Decision Diagrams
by Amin Hosseininasab & Willem-Jan van Hoeve - 739-756 Learning to Solve Large-Scale Security-Constrained Unit Commitment Problems
by Álinson S. Xavier & Feng Qiu & Shabbir Ahmed - 757-773 Scenario Grouping and Decomposition Algorithms for Chance-Constrained Programs
by Yan Deng & Huiwen Jia & Shabbir Ahmed & Jon Lee & Siqian Shen - 774-784 Breaking the r max Barrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem
by Yingli Ran & Zhao Zhang & Shaojie Tang & Ding-Zhu Du - 785-807 Monge Properties, Optimal Greedy Policies, and Policy Improvement for the Dynamic Stochastic Transportation Problem
by Alexander S. Estes & Michael O. Ball - 808-834 A Multistage Stochastic Programming Approach to the Optimal Surveillance and Control of the Emerald Ash Borer in Cities
by Eyyüb Y. Kıbış & İ. Esra Büyüktahtakın & Robert G. Haight & Najmaddin Akhundov & Kathleen Knight & Charles E. Flower - 835-835 Corrigendum to “A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems,” INFORMS Journal on Computing 28(1):14–30, 2016
by Natashia Boland & Riley Clement & Hamish Waterer
January 2021, Volume 33, Issue 1
- 1-1 Note from the Editor
by Alice E. Smith - 2-26 Approximate Dynamic Programming for Military Medical Evacuation Dispatching Policies
by Phillip R. Jenkins & Matthew J. Robbins & Brian J. Lunday - 27-33 SDDP.jl : A Julia Package for Stochastic Dual Dynamic Programming
by Oscar Dowson & Lea Kapelevich - 34-50 High-Performance Prototyping of Decomposition Methods in GAMS
by Timo Lohmann & Michael R. Bussieck & Lutz Westermann & Steffen Rebennack - 51-71 Stochastic Decomposition for Two-Stage Stochastic Linear Programs with Random Cost Coefficients
by Harsha Gangammanavar & Yifan Liu & Suvrajeet Sen - 72-85 Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems
by Satya Tamby & Daniel Vanderpooten - 86-104 A Branch-and-Price Algorithm for Facility Location with General Facility Cost Functions
by Wenjun Ni & Jia Shu & Miao Song & Dachuan Xu & Kaike Zhang - 105-119 Polyhedral Results and Branch-and-Cut for the Resource Loading Problem
by Guopeng Song & Tamás Kis & Roel Leus