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

• 2019
• 
  Ali Aouad, Danny Segev:
  The ordered k-median problem: surrogate models and approximation algorithms. Math. Program. 177(1-2): 55-83 (2019)
• 
  Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király, Euiwoong Lee, Chao Xu:
  Beating the 2-approximation factor for global bicut. Math. Program. 177(1-2): 291-320 (2019)
• 
  Xiaojun Chen, Hailin Sun, Huifu Xu:
  Discrete approximation of two-stage stochastic and distributionally robust linear complementarity problems. Math. Program. 177(1-2): 255-289 (2019)
• 
  Sabrina Fiege, Andrea Walther, Andreas Griewank:
  An algorithm for nonsmooth optimization by successive piecewise linearization. Math. Program. 177(1-2): 343-370 (2019)
• 
  M. Seetharama Gowda, David Sossa:
  Weakly homogeneous variational inequalities and solvability of nonlinear equations over cones. Math. Program. 177(1-2): 149-171 (2019)
• 
  Nam Ho-Nguyen, Fatma Kilinç-Karzan:
  Exploiting problem structure in optimization under uncertainty via online convex optimization. Math. Program. 177(1-2): 113-147 (2019)
• 
  Chien-Chung Huang, Naonori Kakimura, Naoyuki Kamiyama:
  Exact and approximation algorithms for weighted matroid intersection. Math. Program. 177(1-2): 85-112 (2019)
• 
  Christian Kanzow, Daniel Steck:
  Improved local convergence results for augmented Lagrangian methods in $${\varvec{C}}\mathbf{2}$$ C 2 -cone reducible constrained optimization. Math. Program. 177(1-2): 425-438 (2019)
• 
  Do Sang Kim, Tien Son Pham, Nguyen Van Tuyen:
  On the existence of Pareto solutions for polynomial vector optimization problems. Math. Program. 177(1-2): 321-341 (2019)
• 
  Euiwoong Lee:
  Partitioning a graph into small pieces with applications to path transversal. Math. Program. 177(1-2): 1-19 (2019)
• 
  Yanli Liu, Ernest K. Ryu, Wotao Yin:
  A new use of Douglas-Rachford splitting for identifying infeasible, unbounded, and pathological conic programs. Math. Program. 177(1-2): 225-253 (2019)
• 
  Alberto Del Pia, Jeffrey Poskin:
  Characterizations of mixed binary convex quadratic representable sets. Math. Program. 177(1-2): 371-394 (2019)
• 
  Johannes O. Royset, Roger J.-B. Wets:
  Lopsided convergence: an extension and its quantification. Math. Program. 177(1-2): 395-423 (2019)
• 
  Quoc Tran-Dinh, Tianxiao Sun, Shu Lu:
  Self-concordant inclusions: a unified framework for path-following generalized Newton-type algorithms. Math. Program. 177(1-2): 173-223 (2019)
• 
  Juan Pablo Vielma:
  Small and strong formulations for unions of convex sets from the Cayley embedding. Math. Program. 177(1-2): 21-53 (2019)