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

• 2015
• 
  Shadi Sharif Azadeh, Patrice Marcotte, Gilles Savard:
  A non-parametric approach to demand forecasting in revenue management. Comput. Oper. Res. 63: 23-31 (2015)
• 
  Marta Cabo, Edgar Possani, Chris N. Potts, Xiang Song:
  Split-merge: Using exponential neighborhood search for scheduling a batching machine. Comput. Oper. Res. 63: 125-135 (2015)
• 
  Mehmet Ergezer, Dan Simon:
  Probabilistic properties of fitness-based quasi-reflection in evolutionary algorithms. Comput. Oper. Res. 63: 114-124 (2015)
• 
  Diego Jacinto Fiorotto, Silvio Alexandre de Araujo, Raf Jans:
  Hybrid methods for lot sizing on parallel machines. Comput. Oper. Res. 63: 136-148 (2015)
• 
  Luis Eduardo Neves Gouveia, Mario Ruthmair:
  Load-dependent and precedence-based models for pickup and delivery problems. Comput. Oper. Res. 63: 56-71 (2015)
• 
  Kevin R. Gue, Hyun Ho Kim:
  An approximation model for sojourn time distributions in acyclic multi-server queueing networks. Comput. Oper. Res. 63: 46-55 (2015)
• 
  Manuel Iori, Jorge Riera-Ledesma:
  Exact algorithms for the double vehicle routing problem with multiple stacks. Comput. Oper. Res. 63: 83-101 (2015)
• 
  Changmuk Kang, Byung-Cheon Choi:
  An adaptive crashing policy for stochastic time-cost tradeoff problems. Comput. Oper. Res. 63: 1-6 (2015)
• 
  Xiangyong Kong, Liqun Gao, Haibin Ouyang, Steven Li:
  Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm. Comput. Oper. Res. 63: 7-22 (2015)
• 
  Silvano Martello, Michele Monaci:
  Models and algorithms for packing rectangles into the smallest square. Comput. Oper. Res. 63: 161-171 (2015)
• 
  Dilson Lucas Pereira, Michel Gendreau, Alexandre Salles da Cunha:
  Lower bounds and exact algorithms for the quadratic minimum spanning tree problem. Comput. Oper. Res. 63: 149-160 (2015)
• 
  Kate Smith-Miles, Simon Bowly:
  Generating new test instances by evolving in instance space. Comput. Oper. Res. 63: 102-113 (2015)
• 
  Daniel Vaz, Luís Paquete, Carlos M. Fonseca, Kathrin Klamroth, Michael Stiglmayr:
  Representation of the non-dominated set in biobjective discrete optimization. Comput. Oper. Res. 63: 172-186 (2015)
• 
  Michael H. Veatch:
  Approximate linear programming for networks: Average cost bounds. Comput. Oper. Res. 63: 32-45 (2015)
• 
  Jing Xiao, Huasheng Yang, Canrong Zhang, Li Zheng, Jatinder N. D. Gupta:
  A hybrid Lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times. Comput. Oper. Res. 63: 72-82 (2015)