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

• 2022
• 
  Ahmad Abdi, Gérard Cornuéjols, Tony Huynh, Dabeen Lee:
  Idealness of k-wise intersecting families. Math. Program. 192(1): 29-50 (2022)
• 
  Ahmad Abdi, Gérard Cornuéjols, Tony Huynh, Dabeen Lee:
  Correction to: Idealness of k-wise intersecting families. Math. Program. 192(1): 51-55 (2022)
• 
  David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler:
  Flexible Graph Connectivity. Math. Program. 192(1): 409-441 (2022)
• 
  Iskander Aliev, Gennadiy Averkov, Jesús A. De Loera, Timm Oertel:
  Sparse representation of vectors in lattices and semigroups. Math. Program. 192(1): 519-546 (2022)
• 
  Georg Anegg, Haris Angelidakis, Adam Kurpisz, Rico Zenklusen:
  A technique for obtaining true approximations for k-center with covering constraints. Math. Program. 192(1): 3-27 (2022)
• 
  Siddharth Barman, Omar Fawzi, Suprovat Ghoshal, Emirhan Gürpinar:
  Tight approximation bounds for maximum multi-coverage. Math. Program. 192(1): 443-476 (2022)
• 
  Daniel Bienstock, Giacomo Zambelli:
  Special Issue: Integer Programming and Combinatorial Optimization (IPCO) 2020. Math. Program. 192(1): 1-2 (2022)
• 
  Michele Conforti, Samuel Fiorini, Tony Huynh, Stefan Weltge:
  Extended formulations for stable set polytopes of graphs without two disjoint odd cycles. Math. Program. 192(1): 547-566 (2022)
• 
  Sanjeeb Dash, Oktay Günlük, Dabeen Lee:
  On a generalization of the Chvátal-Gomory closure. Math. Program. 192(1): 149-175 (2022)
• 
  Dario Frascaria, Neil Olver:
  Algorithms for flows over time with scheduling costs. Math. Program. 192(1): 177-206 (2022)
• 
  Anupam Gupta, Amit Kumar, Viswanath Nagarajan, Xiangkun Shen:
  Stochastic makespan minimization in structured set systems. Math. Program. 192(1): 597-630 (2022)
• 
  Tim A. Hartmann, Stefan Lendl, Gerhard J. Woeginger:
  Continuous facility location on graphs. Math. Program. 192(1): 207-227 (2022)
• 
  Willem-Jan van Hoeve:
  Graph coloring with decision diagrams. Math. Program. 192(1): 631-674 (2022)
• 
  Xinrui Jia, Kshiteej Sheth, Ola Svensson:
  Fair colorful k-center clustering. Math. Program. 192(1): 339-360 (2022)
• 
  Telikepalli Kavitha, Tamás Király, Jannik Matuschke, Ildikó Schlotter, Ulrike Schmidt-Kraepelin:
  Popular branchings and their dual certificates. Math. Program. 192(1): 567-595 (2022)
• 
  Csaba Király, András Mihálykó:
  Sparse graphs and an augmentation problem. Math. Program. 192(1): 119-148 (2022)
• 
  Kim-Manuel Klein:
  About the complexity of two-stage stochastic IPs. Math. Program. 192(1): 319-337 (2022)
• 
  Max Klimm, Marc E. Pfetsch, Rico Raber, Martin Skutella:
  Packing under convex quadratic constraints. Math. Program. 192(1): 361-386 (2022)
• 
  Yusuke Kobayashi:
  Weighted Triangle-free 2-matching Problem with Edge-disjoint Forbidden Triangles. Math. Program. 192(1): 675-702 (2022)
• 
  Sarah Morell, Martin Skutella:
  Single source unsplittable flows with arc-wise lower and upper bounds. Math. Program. 192(1): 477-496 (2022)
• 
  Benjamin Müller, Gonzalo Muñoz, Maxime Gasse, Ambros M. Gleixner, Andrea Lodi, Felipe Serrano:
  On generalized surrogate duality in mixed-integer nonlinear programming. Math. Program. 192(1): 89-118 (2022)
• 
  Gonzalo Muñoz, Felipe Serrano:
  Maximal quadratic-free sets. Math. Program. 192(1): 229-270 (2022)
• 
  Joseph Paat, Miriam Schlöter, Emily Speakman:
  Constructing lattice-free gradient polyhedra in dimension two. Math. Program. 192(1): 293-317 (2022)
• 
  Joseph Paat, Miriam Schlöter, Robert Weismantel:
  The integrality number of an integer program. Math. Program. 192(1): 271-291 (2022)
• 
  Elisabeth Rodríguez-Heck, Karl Stickler, Matthias Walter, Stefan Weltge:
  Persistency of linear programming relaxations for the stable set problem. Math. Program. 192(1): 387-407 (2022)
• 
  Vera Traub, Thorben Tröbst:
  A fast $(2 + \frac{2}{7})$-approximation algorithm for capacitated cycle covering. Math. Program. 192(1): 497-518 (2022)
• 
  Linchuan Wei, Andrés Gómez, Simge Küçükyavuz:
  Ideal formulations for constrained convex optimization problems with indicator variables. Math. Program. 192(1): 57-88 (2022)