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

• 2003
• 
  Anurag Agarwal, Hasan Pirkul, Varghese S. Jacob:
  Augmented neural networks for task scheduling. Eur. J. Oper. Res. 151(3): 481-502 (2003)
• 
  Antonio Alonso-Ayuso, Laureano F. Escudero, M. Teresa Ortuño:
  BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0-1 programs. Eur. J. Oper. Res. 151(3): 503-519 (2003)
• 
  Jan Annaert, Julien van den Broeck, Rudi Vander Vennet:
  Determinants of mutual fund underperformance: A Bayesian stochastic frontier approach. Eur. J. Oper. Res. 151(3): 617-632 (2003)
• 
  Cédric Avanthay, Alain Hertz, Nicolas Zufferey:
  A variable neighborhood search for graph coloring. Eur. J. Oper. Res. 151(2): 379-388 (2003)
• 
  Oded Berman, Dmitry Krass, Zvi Drezner:
  The gradual covering decay location problem on a network. Eur. J. Oper. Res. 151(3): 474-480 (2003)
• 
  Brenda Cheang, Haibing Li, Andrew Lim, Brian Rodrigues:
  Nurse rostering problems - a bibliographic survey. Eur. J. Oper. Res. 151(3): 447-460 (2003)
• 
  Maria João Cortinhal, M. Eugénia V. Captivo:
  Upper and lower bounds for the single source capacitated location problem. Eur. J. Oper. Res. 151(2): 333-351 (2003)
• 
  Matthias Ehrgott, Dagmar Tenfelde-Podehl:
  Computation of ideal and Nadir values and implications for their use in MCDM methods. Eur. J. Oper. Res. 151(1): 119-139 (2003)
• 
  Andreas Fink, Stefan Voß:
  Solving the continuous flow-shop scheduling problem by metaheuristics. Eur. J. Oper. Res. 151(2): 400-414 (2003)
• 
  Moritz Fleischmann, Roelof Kuik:
  On optimal inventory control with independent stochastic item returns. Eur. J. Oper. Res. 151(1): 25-37 (2003)
• 
  Bernard Fortz, Patrick Soriano, Christelle Wynants:
  A tabu search algorithm for self-healing ring network design. Eur. J. Oper. Res. 151(2): 280-295 (2003)
• 
  Karl Frauendorfer, Michael Schürle:
  Management of non-maturing deposits by multistage stochastic programming. Eur. J. Oper. Res. 151(3): 602-616 (2003)
• 
  Gianpaolo Ghiani, Francesca Guerriero, Gilbert Laporte, Roberto Musmanno:
  Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies. Eur. J. Oper. Res. 151(1): 1-11 (2003)
• 
  José A. Gómez-Limón, Manuel Arriaza, Laura Riesgo:
  An MCDM analysis of agricultural risk aversion. Eur. J. Oper. Res. 151(3): 569-585 (2003)
• 
  Michel Gourgand, Nathalie Grangeon, Sylvie Norre:
  A contribution to the stochastic flow shop scheduling problem. Eur. J. Oper. Res. 151(2): 415-433 (2003)
• 
  Janusz Granat, Francesca Guerriero:
  The interactive analysis of the multicriteria shortest path problem by the reference point method. Eur. J. Oper. Res. 151(1): 103-118 (2003)
• 
  Manfred Gronalt, Richard F. Hartl, Marc Reimann:
  New savings based algorithms for time constrained pickup and delivery of full truckloads. Eur. J. Oper. Res. 151(3): 520-535 (2003)
• 
  Refael Hassin, Asaf Levin, Dana Morad:
  Lexicographic local search and the p. Eur. J. Oper. Res. 151(2): 265-279 (2003)
• 
  Alain Hertz, Marino Widmer:
  Guidelines for the use of meta-heuristics in combinatorial optimization. Eur. J. Oper. Res. 151(2): 247-252 (2003)
• 
  Andrzej Jaszkiewicz, Pawel Kominek:
  Genetic local search with distance preserving recombination operator for a vehicle routing problem. Eur. J. Oper. Res. 151(2): 352-364 (2003)
• 
  Tamás Kis:
  Job-shop scheduling with processing alternatives. Eur. J. Oper. Res. 151(2): 307-332 (2003)
• 
  Torbjörn Larsson, Michael Patriksson, Ann-Brith Strömberg:
  On the convergence of conditional epsilon-subgradient methods for convex programs and convex-concave saddle-point problems. Eur. J. Oper. Res. 151(3): 461-473 (2003)
• 
  B. Mahadevan, David F. Pyke, Moritz Fleischmann:
  Periodic review, push inventory policies for remanufacturing. Eur. J. Oper. Res. 151(3): 536-551 (2003)
• 
  Nenad Mladenovic, J. Petrovic, Vera Kovacevic-Vujcic, Mirjana Cangalovic:
  Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search. Eur. J. Oper. Res. 151(2): 389-399 (2003)
• 
  José A. Moreno-Pérez, J. Marcos Moreno-Vega, Inmaculada Rodríguez Martín:
  Variable neighborhood tabu search and its application to the median cycle problem. Eur. J. Oper. Res. 151(2): 365-378 (2003)
• 
  Tsuneshi Obata, Hiroaki Ishii:
  A method for discriminating efficient candidates with ranked voting data. Eur. J. Oper. Res. 151(1): 233-237 (2003)
• 
  Alan Olinsky, Shaw Chen, Lisa Harlow:
  The comparative efficacy of imputation methods for missing data in structural equation modeling. Eur. J. Oper. Res. 151(1): 53-79 (2003)
• 
  Rogelio Oliva:
  Model calibration as a testing strategy for system dynamics models. Eur. J. Oper. Res. 151(3): 552-568 (2003)
• 
  Maria A. Osorio, Manuel Laguna:
  Logic cuts for multilevel generalized assignment problems. Eur. J. Oper. Res. 151(1): 238-246 (2003)
• 
  Peter J. Ryan:
  Progressive option bounds from the sequence of concurrently expiring options. Eur. J. Oper. Res. 151(1): 193-223 (2003)

skipping 12 more matches