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

• 2007
• 
  Christoph Ambühl, Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson:
  Scheduling with Precedence Constraints of Low Fractional Dimension. IPCO 2007: 130-144
• 
  Kent Andersen, Quentin Louveaux, Robert Weismantel, Laurence A. Wolsey:
  Inequalities from Two Rows of a Simplex Tableau. IPCO 2007: 1-15
• 
  Barbara M. Anthony, Anupam Gupta:
  Infrastructure Leasing Problems. IPCO 2007: 424-438
• 
  Alper Atamtürk, Vishnu Narayanan:
  Cuts for Conic Mixed-Integer Programming. IPCO 2007: 16-29
• 
  Egon Balas, Pierre Bonami:
  New Variants of Lift-and-Project Cut Generation from the LP Tableau: Open Source Implementation and Testing. IPCO 2007: 89-103
• 
  René Beier, Heiko Röglin, Berthold Vöcking:
  The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization. IPCO 2007: 53-67
• 
  Gruia Calinescu, Chandra Chekuri, Martin Pál, Jan Vondrák:
  Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract). IPCO 2007: 182-196
• 
  Michele Conforti, Bert Gerards, Giacomo Zambelli:
  Mixed-Integer Vertex Covers on Bipartite Graphs. IPCO 2007: 324-336
• 
  Michele Conforti, Marco Di Summa, Laurence A. Wolsey:
  The Intersection of Continuous Mixing Polyhedra and the Continuous Mixing Polyhedron with Flows. IPCO 2007: 352-366
• 
  William H. Cunningham, Jim Geelen:
  On Integer Programming and the Branch-Width of the Constraint Matrix. IPCO 2007: 158-166
• 
  Emilie Danna, Mary Fenelon, Zonghao Gu, Roland Wunderling:
  Generating Multiple Solutions for Mixed Integer Programming Problems. IPCO 2007: 280-294
• 
  Sanjeeb Dash, Ricardo Fukasawa, Oktay Günlük:
  On a Generalization of the Master Cyclic Group Polyhedron. IPCO 2007: 197-209
• 
  Sanjeeb Dash, Oktay Günlük, Andrea Lodi:
  On the MIR Closure of Polyhedra. IPCO 2007: 337-351
• 
  Santanu S. Dey, Jean-Philippe P. Richard:
  Sequential-Merge Facets for Two-Dimensional Group Problems. IPCO 2007: 30-42
• 
  Adrian Dumitrescu, Csaba D. Tóth:
  Distinct Triangle Areas in a Planar Point Set. IPCO 2007: 119-129
• 
  Uriel Feige, Kamal Jain, Mohammad Mahdian, Vahab S. Mirrokni:
  Robust Combinatorial Optimization with Exponential Scenarios. IPCO 2007: 439-453
• 
  Eric J. Friedman:
  Finding a Polytope from Its Graph in Polynomial Time. IPCO 2007: 68-73
• 
  Ricardo Fukasawa, Marcos Goycoolea:
  On the Exact Separation of Mixed Integer Knapsack Cuts. IPCO 2007: 225-239
• 
  Takuro Fukunaga, Hiroshi Nagamochi:
  The Set Connector Problem in Graphs. IPCO 2007: 484-498
• 
  Shubhashis Ghosh:
  DINS, a MIP Improvement Heuristic. IPCO 2007: 310-323
• 
  David Hartvigsen, Yanjun Li:
  Triangle-Free Simple 2-Matchings in Subcubic Graphs (Extended Abstract). IPCO 2007: 43-52
• 
  Toshinari Itoko, Satoru Iwata:
  Computational Geometric Approach to Submodular Function Minimization for Multiclass Queueing Systems. IPCO 2007: 267-279
• 
  Volker Kaibel, Matthias Peinhardt, Marc E. Pfetsch:
  Orbitopal Fixing. IPCO 2007: 74-88
• 
  Naonori Kakimura:
  Sign-Solvable Linear Complementarity Problems. IPCO 2007: 397-409
• 
  Jean B. Lasserre, Eduardo S. Zeron:
  Simple Explicit Formula for Counting Lattice Points of Polyhedra. IPCO 2007: 367-381
• 
  Retsef Levi, Andrea Lodi, Maxim Sviridenko:
  Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities. IPCO 2007: 454-468
• 
  James R. Luedtke, Shabbir Ahmed, George L. Nemhauser:
  An Integer Programming Approach for Linear Programs with Probabilistic Constraints. IPCO 2007: 410-423
• 
  Márton Makai, Gyula Pap, Jácint Szabó:
  Matching Problems in Polymatroids Without Double Circuits. IPCO 2007: 167-181
• 
  Kiyohito Nagano:
  On Convex Minimization over Base Polytopes. IPCO 2007: 252-266
• 
  Edwin O'Shea, András Sebö:
  Characterizations of Total Dual Integrality. IPCO 2007: 382-396

skipping 7 more matches