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

• 2019
• 
  Tarik Aouam, Mario Vanhoucke:
  An agency perspective for multi-mode project scheduling with time/cost trade-offs. Comput. Oper. Res. 105: 167-186 (2019)
• 
  Florian Arnold, Kenneth Sörensen:
  Knowledge-guided local search for the vehicle routing problem. Comput. Oper. Res. 105: 32-46 (2019)
• 
  Herminia I. Calvete, Concepción Domínguez, Carmen Galé, Martine Labbé, Alfredo Marín:
  The rank pricing problem: Models and branch-and-cut algorithms. Comput. Oper. Res. 105: 12-31 (2019)
• 
  Tsui-Ping Chung, Jatinder N. D. Gupta, Haidan Zhao, Frank Werner:
  Minimizing the makespan on two identical parallel machines with mold constraints. Comput. Oper. Res. 105: 141-155 (2019)
• 
  François Clautiaux, Jérémy Guillot, Pierre Pesneau:
  Exact approaches for solving a covering problem with capacitated subtrees. Comput. Oper. Res. 105: 85-101 (2019)
• 
  Mansoor Davoodi:
  k-Balanced Center Location problem: A new multi-objective facility location problem. Comput. Oper. Res. 105: 68-84 (2019)
• 
  Okan Dukkanci, Bahar Yetis Kara, Tolga Bektas:
  The green location-routing problem. Comput. Oper. Res. 105: 187-202 (2019)
• 
  Carlo Filippi, Wlodzimierz Ogryczak, M. Grazia Speranza:
  Bridging k-sum and CVaR optimization in MILP. Comput. Oper. Res. 105: 156-166 (2019)
• 
  Hamza Heni, Leandro C. Coelho, Jacques Renaud:
  Determining time-dependent minimum cost paths under several objectives. Comput. Oper. Res. 105: 102-117 (2019)
• 
  Zhao-Hong Jia, Xue-Xue Zhuo, Joseph Y.-T. Leung, Kai Li:
  Corrigendum to "Integrated production and transportation on parallel batch machines to minimize total weighted delivery time" [Computers and Operations Research Volume 102, pages 39-51]. Comput. Oper. Res. 105: 248 (2019)
• 
  Alexander Kline, Darryl K. Ahner, Raymond R. Hill:
  The Weapon-Target Assignment Problem. Comput. Oper. Res. 105: 226-236 (2019)
• 
  Ibrahim Kucukkoc:
  MILP models to minimise makespan in additive manufacturing machine scheduling problems. Comput. Oper. Res. 105: 58-67 (2019)
• 
  Jinlin Li, Xiaohong Chen, Zhanguo Zhu, Caijun Yang, Chengbin Chu:
  A branch, bound, and remember algorithm for the simple disassembly line balancing problem. Comput. Oper. Res. 105: 47-57 (2019)
• 
  Manon Raap, Michael Preuß, Silja Meyer-Nieberg:
  Moving target search optimization - A literature review. Comput. Oper. Res. 105: 132-140 (2019)
• 
  Youngchul Shin, Sungwoo Kim, Ilkyeong Moon:
  Integrated optimal scheduling of repair crew and relief vehicle after disaster. Comput. Oper. Res. 105: 237-247 (2019)
• 
  Túlio A. M. Toffolo, Thibaut Vidal, Tony Wauters:
  Heuristics for vehicle routing problems: Sequence or set optimization? Comput. Oper. Res. 105: 118-131 (2019)
• 
  Elias J. Willemse, Johan W. Joubert:
  Efficient local search strategies for the Mixed Capacitated Arc Routing Problems under Time Restrictions with Intermediate Facilities. Comput. Oper. Res. 105: 203-225 (2019)
• 
  Lu Zhen, Miao Li, Gilbert Laporte, Wencheng Wang:
  A vehicle routing problem arising in unmanned aerial monitoring. Comput. Oper. Res. 105: 1-11 (2019)