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

• 2011
• 
  Hasan Murat Afsar, Nicolas Jozefowiez, Pierre Lopez:
  A branch-and-price algorithm for the windy rural postman problem. RAIRO Oper. Res. 45(4): 353-364 (2011)
• 
  Alireza Amirteimoori, Ali Emrouznejad:
  Flexible measures in production process: A DEA-based approach. RAIRO Oper. Res. 45(1): 63-74 (2011)
• 
  Mike Benchimol, Pascal Benchimol, Benoît Chappert, Arnaud de la Taille, Fabien Laroche, Frédéric Meunier, Ludovic Robinet:
  Balancing the stations of a self service "bike hire" system. RAIRO Oper. Res. 45(1): 37-61 (2011)
• 
  Nicolas Boria, Vangelis Th. Paschos:
  A survey on combinatorial optimization in dynamic environments. RAIRO Oper. Res. 45(3): 241-294 (2011)
• 
  Alfredo Candia-Véjar, Eduardo Álvarez-Miranda, Nelson Maculan:
  Minmax regret combinatorial optimization problems: an Algorithmic Perspective. RAIRO Oper. Res. 45(2): 101-129 (2011)
• 
  Faouzi Ben Charrada, Sana Ezouaoui, Zaher Mahjoub:
  Greedy algorithms for optimal computing of matrix chain products involving square dense and triangular matrices. RAIRO Oper. Res. 45(1): 1-16 (2011)
• 
  Amit Choudhury, Medhi Pallabi:
  Some aspects of balking and reneging in finite buffer queues. RAIRO Oper. Res. 45(3): 223-240 (2011)
• 
  Laureano Fernando Escudero Bueno, Susana Muñoz:
  On designing connected rapid transit networks reducing the number of transfers. RAIRO Oper. Res. 45(4): 315-338 (2011)
• 
  Josep Freixas, Xavier Molinero, Martin Olsen, Maria J. Serna:
  On the complexity of problems on simple games. RAIRO Oper. Res. 45(4): 295-314 (2011)
• 
  Philippe Gambette, Alain Guénoche:
  Bootstrap clustering for graph partitioning. RAIRO Oper. Res. 45(4): 339-352 (2011)
• 
  Marina Groshaus, Jayme Luiz Szwarcfiter:
  Algorithms for recognizing bipartite-Helly and bipartite-conformal hypergraphs, . RAIRO Oper. Res. 45(3): 209-222 (2011)
• 
  Moshe Haviv, Rita Zlotnikov:
  Computational schemes for two exponential servers where the first has a finite buffer. RAIRO Oper. Res. 45(1): 17-36 (2011)
• 
  Hervé Kerivin, Mathieu Lacroix, Alain Quilliot, Hélène Toussaint:
  Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem. RAIRO Oper. Res. 45(3): 179-207 (2011)
• 
  Muthukrishnan Senthil Kumar:
  A discrete-time Geo^[X]/G/1 retrial queue with general retrial time and M-additional options for service. RAIRO Oper. Res. 45(2): 131-152 (2011)
• 
  Luis A. A. Meira, Flávio Keidi Miyazawa:
  Semidefinite Programming Based Algorithms for the Sparsest Cut Problem. RAIRO Oper. Res. 45(2): 75-100 (2011)
• 
  Peng-Sheng You, Yi-Chih Hsieh, Hisn-Hung Chen:
  A hybrid genetic algorithm for a dynamic logistics network with multi-commodities and components. RAIRO Oper. Res. 45(2): 153-178 (2011)