• 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 19 matches

• 2021
• 
  Aaron Babier, Timothy C. Y. Chan, Taewoo Lee, Rafid Mahmood, Daria Terekhov:
  An Ensemble Learning Framework for Model Fitting and Evaluation in Inverse Linear Optimization. INFORMS J. Optim. 3(2): 119-138 (2021)
• 
  Chun Cheng, Yossiri Adulyasak, Louis-Martin Rousseau:
  Robust Facility Location Under Disruptions. INFORMS J. Optim. 3(3): 298-314 (2021)
• 
  Pavithra Harsha, Ramesh Natarajan, Dharmashankar Subramanian:
  A Prescriptive Machine-Learning Framework to the Price-Setting Newsvendor Problem. INFORMS J. Optim. 3(3): 227-253 (2021)
• 
  Huiwen Jia, Siqian Shen:
  Benders Cut Classification via Support Vector Machines for Solving Two-Stage Stochastic Programs. INFORMS J. Optim. 3(3): 278-297 (2021)
• 
  Seulgi Joung, Sungsoo Park:
  Robust Mixed 0-1 Programming and Submodularity. INFORMS J. Optim. 3(2): 183-199 (2021)
• 
  Xin Yee Lam, Defeng Sun, Kim-Chuan Toh:
  Semi-proximal Augmented Lagrangian-Based Decomposition Methods for Primal Block-Angular Convex Composite Quadratic Conic Programming Problems. INFORMS J. Optim. 3(3): 254-277 (2021)
• 
  Xiaoyue Li, John M. Mulvey:
  Portfolio Optimization Under Regime Switching and Transaction Costs: Combining Neural Networks and Dynamic Programs. INFORMS J. Optim. 3(4): 398-417 (2021)
• 
  Zichong Li, Yangyang Xu:
  Augmented Lagrangian-Based First-Order Methods for Convex-Constrained Programs with Weakly Convex Objective. INFORMS J. Optim. 3(4): 373-397 (2021)
• 
  Cong Han Lim, Jeffrey T. Linderoth, James R. Luedtke, Stephen J. Wright:
  Parallelizing Subgradient Methods for the Lagrangian Dual in Stochastic Mixed-Integer Programming. INFORMS J. Optim. 3(1): 1-22 (2021)
• 
  Jeff T. Linderoth, José Núñez Ares, James Ostrowski, Fabrizio Rossi, Stefano Smriglio:
  Orbital Conflict: Cutting Planes for Symmetric Integer Programs. INFORMS J. Optim. 3(2): 139-153 (2021)
• 
  Hasan Manzour, Simge Küçükyavuz, Hao-Hsiang Wu, Ali Shojaie:
  Integer Programming for Learning Directed Acyclic Graphs from Continuous Data. INFORMS J. Optim. 3(1): 46-73 (2021)
• 
  Jacob Mays:
  Quasi-Stochastic Electricity Markets. INFORMS J. Optim. 3(4): 350-372 (2021)
• 
  Divya Padmanabhan, Karthik Natarajan:
  Tree Bounds for Sums of Bernoulli Random Variables: A Linear Optimization Approach. INFORMS J. Optim. 3(1): 23-45 (2021)
• 
  Koen Peters, Sérgio Silva, Rui Gonçalves, Mirjana Kavelj, Hein A. Fleuren, Dick den Hertog, Özlem Ergun, Mallory Freeman:
  The Nutritious Supply Chain: Optimizing Humanitarian Food Assistance. INFORMS J. Optim. 3(2): 200-226 (2021)
• 
  Alberto Del Pia, Silvia Di Gregorio:
  Chvátal Rank in Binary Polynomial Optimization. INFORMS J. Optim. 3(4): 315-349 (2021)
• 
  Rajan Udwani:
  Multiobjective Maximization of Monotone Submodular Functions with Cardinality Constraint. INFORMS J. Optim. 3(1): 74-88 (2021)
• 
  Yangyang Xu:
  First-Order Methods for Constrained Convex Programming Based on Linearized Augmented Lagrangian Function. INFORMS J. Optim. 3(1): 89-117 (2021)
• 
  Yibo Xu, Yangyang Xu:
  Katyusha Acceleration for Convex Finite-Sum Compositional Optimization. INFORMS J. Optim. 3(4): 418-443 (2021)
• 
  Zhewei Yao, Peng Xu, Fred Roosta, Michael W. Mahoney:
  Inexact Nonconvex Newton-Type Methods. INFORMS J. Optim. 3(2): 154-182 (2021)