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

• 2023
• 
  Manuel Aprile, Matthew Drescher, Samuel Fiorini, Tony Huynh:
  A tight approximation algorithm for the cluster vertex deletion problem. Math. Program. 197(2): 1069-1091 (2023)
• 
  Gennadiy Averkov, Christopher Hojny, Matthias Schymura:
  Computational aspects of relaxation complexity: possibilities and limitations. Math. Program. 197(2): 1173-1200 (2023)
• 
  Michele Barbato, Roland Grappe, Mathieu Lacroix, Emiliano Lancini:
  Box-total dual integrality and edge-connectivity. Math. Program. 197(1): 307-336 (2023)
• 
  Amitabh Basu, Hongyi Jiang:
  Two-halfspace closure. Math. Program. 197(1): 411-426 (2023)
• 
  Calvin Beideman, Karthekeyan Chandrasekaran, Chao Xu:
  Multicriteria cuts and size-constrained k-cuts in hypergraphs. Math. Program. 197(1): 27-69 (2023)
• 
  Daniel Bienstock, Alberto Del Pia, Robert Hildebrand:
  Complexity, exactness, and rationality in polynomial optimization. Math. Program. 197(2): 661-692 (2023)
• 
  Jannis Blauth, Vera Traub, Jens Vygen:
  Improving the approximation ratio for capacitated vehicle routing. Math. Program. 197(2): 451-497 (2023)
• 
  Digvijay Boob, Qi Deng, Guanghui Lan:
  Stochastic first-order methods for convex and nonconvex functional constrained optimization. Math. Program. 197(1): 215-279 (2023)
• 
  Sander Borst, Daniel Dadush, Sophie Huiberts, Samarth Tiwari:
  On the integrality gap of binary integer programs with Gaussian data. Math. Program. 197(2): 1221-1263 (2023)
• 
  Niv Buchbinder, Christian Coester, Joseph Naor:
  Online k-taxi via Double Coverage and time-reverse primal-dual. Math. Program. 197(2): 499-527 (2023)
• 
  Robert Carr, R. Ravi, Neil Simonetti:
  A new integer programming formulation of the graphical traveling salesman problem. Math. Program. 197(2): 877-902 (2023)
• 
  Marcel Celaya, Martin Henk:
  Proximity bounds for random integer programs. Math. Program. 197(2): 1201-1219 (2023)
• 
  Deeparnab Chakrabarty, Maryam Negahbani:
  Robust k-center with two types of radii. Math. Program. 197(2): 991-1007 (2023)
• 
  Karthekeyan Chandrasekaran, Weihang Wang:
  Fixed parameter approximation scheme for min-max k-cut. Math. Program. 197(2): 1093-1144 (2023)
• 
  Antonia Chmiela, Gonzalo Muñoz, Felipe Serrano:
  On the implementation and strengthening of intersection cuts for QCQPs. Math. Program. 197(2): 549-586 (2023)
• 
  Cyrille W. Combettes, Sebastian Pokutta:
  Revisiting the approximate Carathéodory problem via the Frank-Wolfe algorithm. Math. Program. 197(1): 191-214 (2023)
• 
  Siad Daboul, Stephan Held, Jens Vygen:
  Approximating the discrete time-cost tradeoff problem with bounded depth. Math. Program. 197(2): 529-547 (2023)
• 
  Damek Davis:
  Variance reduction for root-finding problems. Math. Program. 197(1): 375-410 (2023)
• 
  Santanu S. Dey, Mohit Singh, David P. Williamson:
  Special Issue: Integer Programming and Combinatorial Optimization (IPCO) 2021. Math. Program. 197(2): 449-450 (2023)
• 
  Franziska Eberle, Ruben Hoeksma, Nicole Megow, Lukas Nölke, Kevin Schewior, Bertrand Simon:
  Speed-robust scheduling: sand, bricks, and rocks. Math. Program. 197(2): 1009-1048 (2023)
• 
  Leon Eifler, Ambros M. Gleixner:
  A computational status update for exact rational mixed integer programming. Math. Program. 197(2): 793-812 (2023)
• 
  Anders Eltved, Samuel Burer:
  Strengthened SDP relaxation for an extended trust region subproblem with an application to optimal power flow. Math. Program. 197(1): 281-306 (2023)
• 
  Yuri Faenza, Xuan Zhang:
  Affinely representable lattices, stable matchings, and choice functions. Math. Program. 197(2): 721-760 (2023)
• 
  Paritosh Garg, Linus Jordan, Ola Svensson:
  Semi-streaming algorithms for submodular matroid intersection. Math. Program. 197(2): 967-990 (2023)
• 
  Lukas Graf, Tobias Harks:
  A finite time combinatorial algorithm for instantaneous dynamic equilibrium flows. Math. Program. 197(2): 761-792 (2023)
• 
  Xiaoyi Gu, Santanu S. Dey, Jean-Philippe P. Richard:
  Lifting convex inequalities for bipartite bilinear programs. Math. Program. 197(2): 587-619 (2023)
• 
  Mirko Hahn, Sven Leyffer, Sebastian Sager:
  Binary optimal control by trust-region steepest descent. Math. Program. 197(1): 147-190 (2023)
• 
  Klaus Jansen, Kim-Manuel Klein, Alexandra Lassota:
  The double exponential runtime is tight for 2-stage stochastic ILPs. Math. Program. 197(2): 1145-1172 (2023)
• 
  Max Klimm, Marc E. Pfetsch, Rico Raber, Martin Skutella:
  On the robustness of potential-based flow networks. Math. Program. 197(1): 337-374 (2023)
• 
  Vinícius Loti de Lima, Manuel Iori, Flávio Keidi Miyazawa:
  Exact solution of network flow models with strong relaxations. Math. Program. 197(2): 813-846 (2023)

skipping 10 more matches