• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 73 matches

• 2020
• 
  Tobias Achterberg, Robert E. Bixby, Zonghao Gu, Edward Rothberg, Dieter Weninger:
  Presolve Reductions in Mixed Integer Programming. INFORMS J. Comput. 32(2): 473-506 (2020)
• 
  Vishal Ahuja, John R. Birge:
  An Approximation Approach for Response-Adaptive Clinical Trial Design. INFORMS J. Comput. 32(4): 877-894 (2020)
• 
  Ali Ajdari, Fatemeh Saberian, Archis Ghate:
  A Theoretical Framework for Learning Tumor Dose-Response Uncertainty in Individualized Spatiobiologically Integrated Radiotherapy. INFORMS J. Comput. 32(4): 930-951 (2020)
• 
  Hrayer Aprahamian, Douglas R. Bish, Ebru K. Bish:
  Optimal Group Testing: Structural Properties and Robust Solutions, with Application to Public Health Screening. INFORMS J. Comput. 32(4): 895-911 (2020)
• 
  Okan Arslan, Ola Jabali, Gilbert Laporte:
  A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints. INFORMS J. Comput. 32(1): 120-134 (2020)
• 
  Alper Atamtürk, Carlos Deck, Hyemin Jeon:
  Successive Quadratic Upper-Bounding for Discrete Mean-Risk Minimization and Network Interdiction. INFORMS J. Comput. 32(2): 346-355 (2020)
• 
  Ilke Bakir, Natashia Boland, Brian C. Dandurand, Alan L. Erera:
  Sampling Scenario Set Partition Dual Bounds for Multistage Stochastic Programs. INFORMS J. Comput. 32(1): 145-163 (2020)
• 
  Egon Balas, Thiago Serra:
  When Lift-and-Project Cuts Are Different. INFORMS J. Comput. 32(3): 822-834 (2020)
• 
  Sean 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. INFORMS J. Comput. 32(4): 912-929 (2020)
• 
  Gerdus Benadè, John N. Hooker:
  Optimization Bounds from the Branching Dual. INFORMS J. Comput. 32(1): 3-15 (2020)
• 
  Dimitris Bertsimas, Iain Dunning:
  Relative Robust and Adaptive Optimization. INFORMS J. Comput. 32(2): 408-427 (2020)
• 
  Ksenia Bestuzheva, Hassan L. Hijazi, Carleton Coffrin:
  Convex Relaxations for Quadratic On/Off Constraints and Applications to Optimal Transmission Switching. INFORMS J. Comput. 32(3): 682-696 (2020)
• 
  Maurizio Boccia, Antonio Sforza, Claudio Sterle:
  Simple Pattern Minimality Problems: Integer Linear Programming Formulations and Covering-Based Heuristic Solving Approaches. INFORMS J. Comput. 32(4): 1049-1060 (2020)
• 
  Zdravko I. Botev, Pierre L'Ecuyer:
  Sampling Conditionally on a Rare Event via Generalized Splitting. INFORMS J. Comput. 32(4): 986-995 (2020)
• 
  Gerald G. Brown, W. Matthew Carlyle:
  Solving the Nearly Symmetric All-Pairs Shortest-Path Problem. INFORMS J. Comput. 32(2): 279-288 (2020)
• 
  Geunyeong Byeon, Pascal Van Hentenryck, Russell Bent, Harsha Nagarajan:
  Communication-Constrained Expansion Planning for Resilient Distribution Systems. INFORMS J. Comput. 32(4): 968-985 (2020)
• 
  Francesco 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. INFORMS J. Comput. 32(4): 1030-1048 (2020)
• 
  Margarita P. Castro, André Augusto Ciré, J. Christopher Beck:
  An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP. INFORMS J. Comput. 32(2): 263-278 (2020)
• 
  Xiaoye Cheng, Jingjing Zhang, Lu Lucy Yan:
  Understanding the Impact of Individual Users' Rating Characteristics on the Predictive Accuracy of Recommender Systems. INFORMS J. Comput. 32(2): 303-320 (2020)
• 
  Kyle Cooper, Susan R. Hunter:
  PyMOSO: Software for Multiobjective Simulation Optimization with R-PERLE and R-MinRLE. INFORMS J. Comput. 32(4): 1101-1108 (2020)
• 
  Kyle Cooper, Susan R. Hunter, Kalyani Nagaraj:
  Biobjective Simulation Optimization on Integer Lattices Using the Epsilon-Constraint Method in a Retrospective Approximation Framework. INFORMS J. Comput. 32(4): 1080-1100 (2020)
• 
  Zhenyu Cui, Michael C. Fu, Jian-Qiang Hu, Yanchu Liu, Yijie Peng, Lingjiong Zhu:
  On the Variance of Single-Run Unbiased Stochastic Derivative Estimators. INFORMS J. Comput. 32(2): 390-407 (2020)
• 
  Samuel Deleplanque, Martine Labbé, Diego Ponce, Justo Puerto:
  A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem. INFORMS J. Comput. 32(3): 582-599 (2020)
• 
  Maxence Delorme, Manuel Iori:
  Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems. INFORMS J. Comput. 32(1): 101-119 (2020)
• 
  Dilek Günneç, S. Raghavan, Rui Zhang:
  Least-Cost Influence Maximization on Social Networks. INFORMS J. Comput. 32(2): 289-302 (2020)
• 
  Zhiling Guo, Jin Li, Ram Ramesh:
  Scalable, Adaptable, and Fast Estimation of Transient Downtime in Virtual Infrastructures Using Convex Decomposition and Sample Path Randomization. INFORMS J. Comput. 32(2): 321-345 (2020)
• 
  Joshua Q. Hale, Helin Zhu, Enlu Zhou:
  Domination Measure: A New Metric for Solving Multiobjective Optimization. INFORMS J. Comput. 32(3): 565-581 (2020)
• 
  Nir Halman:
  Provably Near-Optimal Approximation Schemes for Implicit Stochastic and Sample-Based Dynamic Programs. INFORMS J. Comput. 32(4): 1157-1181 (2020)
• 
  Kai Han, Yuntian He, Alex X. Liu, Shaojie Tang, He Huang:
  Differentially Private and Budget-Limited Bandit Learning over Matroids. INFORMS J. Comput. 32(3): 790-804 (2020)
• 
  Seyedmohammadhossein 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. INFORMS J. Comput. 32(3): 747-762 (2020)

skipping 43 more matches