Request Username
Can't sign in? Forgot your username?
Enter your email address below and we will send you your username
Forthcoming
Issues in Advance
Starting in 2014, select INFORMS journals migrated to Issues in Advance, a continuous publication (CP) model. Continuous publication allows issues to be created online article-by-article. As each article is published online, it is assigned to an issue and posted with its volume, issue, and page numbers. Once an issue is “full” online (equals the allotted pages or arrived at the issue release date), that issue is closed and will be printed per the production schedule.
The greatest benefit of Issues in Advance (IiA) is that authors will not have to wait for an issue assignment. IiA will allow an article to be referenced immediately upon publication using a complete citation: volume, issue, page numbers. The residual effects of this include meeting requirements of search and tenure committees, having fewer versions of the articles in cyberspace, and ensuring correct citations for journal and article impact reports.
Summer 2018 Issue in Advance - In Progress
30(3)
ForthcomingNot Yet Scheduled
Quadratic Combinatorial Optimization Using Separable Underestimators
Christoph Buchheim and Emiliano Traversi
Christoph Buchheim and Emiliano Traversi
Scenario Generation for Single-period Portfolio Selection Problems with Tail Risk Measures: Coping with High Dimensions and Integer Variables
Jamie Fairbrother, Amanda Turner, and Stein W. Wallace
Jamie Fairbrother, Amanda Turner, and Stein W. Wallace
T-Closeness Slicing: A New Privacy Preserving Approach for Transactional Data Publishing
Mingzheng Wang, Zhengrui Jiang, Yu Zhang, and Haifang Yang
Mingzheng Wang, Zhengrui Jiang, Yu Zhang, and Haifang Yang
Portfolio Optimization with Nonparametric Value-at-Risk: A Block Coordinate Descent Method
Xueting Cui, Xiaoling Sun, Shushang Zhu, Rujun Jiang, and Duan Li
Xueting Cui, Xiaoling Sun, Shushang Zhu, Rujun Jiang, and Duan Li
An Extended MIP Formulation and Dynamic Cut Generation Approach for the Stochastic Lot Sizing Problem
Huseyin Tunc, Onur A. Kilic, S. Armagan Tarim, and Roberto Rossi
Spare Parts Inventory Management with Substitution-Dependent Reliability
Amin Khademi and Burak Eksioglu
Amin Khademi and Burak Eksioglu
Risk Averse Shortest Paths: A Computational Study
Renaud Chicoisne, Fernando Ordóñez, and Daniel Espinoza
Renaud Chicoisne, Fernando Ordóñez, and Daniel Espinoza
Lateness Minimization in Pairwise Connectivity Restoration Problems
Igor Averbakh and Jordi Pereira
Igor Averbakh and Jordi Pereira
What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO
Iain Dunning, Swati Gupta, and John Silberholz
Iain Dunning, Swati Gupta, and John Silberholz
Structure Detection in Mixed Integer Programs
Taghi Khaniyev, Samir Elhedhli, and Fatih Safa Erenay
Taghi Khaniyev, Samir Elhedhli, and Fatih Safa Erenay
Physician Staffing for Emergency Departments with Time-Varying Demand
Ran Liu and Xiaolan Xie
The Vehicle Routing Problem with Floating Targets: Formulation and Solution Approaches
Claudio Gambella, Joe Naoum-Sawaya, and Bissan Ghaddar
Ran Liu and Xiaolan Xie
The Vehicle Routing Problem with Floating Targets: Formulation and Solution Approaches
Claudio Gambella, Joe Naoum-Sawaya, and Bissan Ghaddar
Surrogate-Based Promising Area Search for Lipschitz Continuous Simulation Optimization
Qi Fan and Jiaqiao Hu
Qi Fan and Jiaqiao Hu
The Ramping Polytope and Cut Generation for the Unit Commitment Problem
Ben Knueven, Jim Ostrowski, and Jianhui Wang
Ben Knueven, Jim Ostrowski, and Jianhui Wang
A Knowledge Gradient Policy for Sequencing Experiments to Identify the Structure of RNA Molecules Using a Sparse Additive Belief Model
Yan Li, Kristofer G. Reyes, Jorge Vazquez-Anderson, Yingfei Wang, Lydia M. Contreras, and Warren B. Powell
Yan Li, Kristofer G. Reyes, Jorge Vazquez-Anderson, Yingfei Wang, Lydia M. Contreras, and Warren B. Powell
Disjunctive Programming for Multiobjective Discrete Optimisation
Tolga Bektaş
Tolga Bektaş
Computable Error Bounds of Laplace Inversion for Pricing Asian Options
Yingda Song, Ning Cai, and Steven Kou
Yingda Song, Ning Cai, and Steven Kou
Methods for System Selection Based on Sequential Mean-Variance Analysis
Demet Batur, Lina Wang, and Fred Choobineh
Demet Batur, Lina Wang, and Fred Choobineh
The Meet-in-the-Middle Principle for Cutting and Packing Problems
Jean-Franҫois Côté and Manuel Iori
Jean-Franҫois Côté and Manuel Iori
A Joint Vehicle Routing and Speed Optimization Problem
Ricardo Fukasawa, Qie He, Fernando Santos, and Yongjia Song
Ricardo Fukasawa, Qie He, Fernando Santos, and Yongjia Song
A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching
Daniel Kowalczyk and Roel Leus
Daniel Kowalczyk and Roel Leus
An Asymptotically Optimal Set Approach for Simulation Optimization
Liujia Hu and Sigrún Andradóttir
Liujia Hu and Sigrún Andradóttir
A Feasibility Pump and Local Search Based Heuristic for Bi-objective Pure Integer Linear Programming
Aritra Pal and Hadi Charkhgard
Aritra Pal and Hadi Charkhgard
Mathematical Programming Algorithms for Spatial Cloaking
Alberto Ceselli, Maria Luisa Damiani, Giovanni Righini, and Diego Valorsi
Alberto Ceselli, Maria Luisa Damiani, Giovanni Righini, and Diego Valorsi
A Unified Decomposition Matheuristic for Assembly, Production and Inventory Routing
Masoud Chitsaz, Jean-Franҫois Cordeau, and Raf Jans
Masoud Chitsaz, Jean-Franҫois Cordeau, and Raf Jans
Data-Driven Decisions for Problems with an Unspecified Objective Function
Zhen Sun, Milind Dawande, Ganesh Janakiraman, and Vijay Mookerjee
Zhen Sun, Milind Dawande, Ganesh Janakiraman, and Vijay Mookerjee
Robust Optimization of Dose-volume Metrics for Prostate HDR-brachytherapy Incorporating Target and
OAR Volume Delineation Uncertainties
Marleen Balvert, Dick denk Hertog, and Aswin L. Hoffmann
Marleen Balvert, Dick denk Hertog, and Aswin L. Hoffmann
Dynamic Compressor Optimization in Natural Gas Pipeline Systems
Terrence W.K. Mak, Pascal Van Hentenryck, Anatoly Zlotnik, and Russell Bent
Terrence W.K. Mak, Pascal Van Hentenryck, Anatoly Zlotnik, and Russell Bent
Primal Heuristics for Branch-and-Price: The Assets of Diving Methods
Ruslan Sadykov, François Vanderbeck, Artur Pessoa, Issam Tahiri, and Eduardo Uchoa
Ruslan Sadykov, François Vanderbeck, Artur Pessoa, Issam Tahiri, and Eduardo Uchoa
Modelling Human Decision Behaviour with Preference-learning
Manish Aggarwal and Ali Fallah Tehrani
Manish Aggarwal and Ali Fallah Tehrani
Transit Pattern Detection Using Tensor Factorization
Bowen Du, Wenjun Zhou, Chuanren Liu, Yifeng Cui, and Hui Xiong
Bowen Du, Wenjun Zhou, Chuanren Liu, Yifeng Cui, and Hui Xiong
Performance Comparison of Machine Learning Platforms
Asim Roy, Shiban Qureshi, Kartikeya Pande, Divitha Nair, Kartik Gairola, Pooja Jain, Suraj Singh, Kirti
Asim Roy, Shiban Qureshi, Kartikeya Pande, Divitha Nair, Kartik Gairola, Pooja Jain, Suraj Singh, Kirti
Sharma, Akshay Jagadale, Shashank, Ramya Gotety, Yuexin Zhang, Ji Tang, Tejas Mehta, Hemanth
Sindhanuru, Nonso Okafor, Santak Das, Chidambara N. Gopal, Srinivasa B. Rudraraju, and Avinash V.
Kakarlapudi
A Branch-and-Bound Approach to the Traveling Salesman Problem with a Drone
Stefan Poikonen, Bruce Golden, and Edward Wasil
Stefan Poikonen, Bruce Golden, and Edward Wasil
New Valid Inequalities for the Optimal Communication Spanning Tree Problem
Yogesh Kumar Agarwal and Prahalad Venkateshan
Yogesh Kumar Agarwal and Prahalad Venkateshan
Modeling and Simulation of Nonstationary Non-Poisson Arrival Processes
Ran Liu, Michael E. Kuhl, Yunan Liu, and James R. Wilson
Finding Critical Links for Closeness Centrality
Alexander Veremyev, Oleg A. Prokopyev, and Eduardo L. Pasiliao
Ran Liu, Michael E. Kuhl, Yunan Liu, and James R. Wilson
Finding Critical Links for Closeness Centrality
Alexander Veremyev, Oleg A. Prokopyev, and Eduardo L. Pasiliao
Target Cuts from Relaxed Decision Diagrams
Christian Tjandraatmadja and Willem-Jan van Hoeve
Christian Tjandraatmadja and Willem-Jan van Hoeve
Interdiction Games and Monotonicity, with Application to Knapsack Problems
Matteo Fischetti, Ivana Ljubić, Michele Monaci, and Markus Sinnl
Matteo Fischetti, Ivana Ljubić, Michele Monaci, and Markus Sinnl
2D-Phase Unwrapping via Balanced Spanning Forests
Ian Herszterg, Marcus Poggi, and Thibaut Vidal
Ian Herszterg, Marcus Poggi, and Thibaut Vidal
A Dynamic Programming Approach to Power Consumption Minimization in Gunbarrel Natural Gas Networks with Non-identical Compressor Units
Tianhu Deng, Yong Liang, Shixuan Zhang, Jingze Ren, and Shuyi Zheng
Tianhu Deng, Yong Liang, Shixuan Zhang, Jingze Ren, and Shuyi Zheng
Robust Maximum Likelihood Estimation
Dimitris Bertsimas and Omid Nohadani
Dimitris Bertsimas and Omid Nohadani
Chance-Constrained Surgery Planning Under Conditions of Limited and Ambiguous Data
Yan Deng, Siqian Shen, and Brian Denton
Yan Deng, Siqian Shen, and Brian Denton
An Efficient Morris Method-based Framework for Simulation Factor Screening
Wen Shi, Xi Chen, and Jennifer Shang
Wen Shi, Xi Chen, and Jennifer Shang
Learning to Rank in Entity Relationship Graphs
Louiqa Raschid, Hassan Sayyadi, and Vagelis Hristidis
Louiqa Raschid, Hassan Sayyadi, and Vagelis Hristidis
Solving Large Batches of Linear Programs
Ilbin Lee, Stewart Curry, and Nicoleta Serban
Ilbin Lee, Stewart Curry, and Nicoleta Serban
Virtual Statistics in Simulation via k Nearest Neighbors
Yujing Lin, Barry L. Nelson, and Linda Pei
Yujing Lin, Barry L. Nelson, and Linda Pei
An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating
David Bergman
David Bergman
Real-Time Radiation Treament Planning with Optimality Guarantees via Cluster and Bound Methods
Baris Ungun, Lei Xing, and Stephen Boyd
Baris Ungun, Lei Xing, and Stephen Boyd
Integrated Scheduling of Production and Two-Stage Delivery of Make-to-Order Products: Offline and Online Algorithms
Lixin Tang, Feng Li, and Zhi-Long Chen