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

• 2021
• 
  Hossein Badri, Tayebeh Bahreini, Daniel Grosu:
  A parallel randomized approximation algorithm for non-preemptive single machine scheduling with release dates and delivery times. Comput. Oper. Res. 130: 105238 (2021)
• 
  Marta Baldomero-Naranjo, Jörg Kalcsics, Antonio M. Rodríguez-Chía:
  Minmax regret maximal covering location problems with edge demands. Comput. Oper. Res. 130: 105181 (2021)
• 
  Matthew Bold, Marc Goerigk:
  A compact reformulation of the two-stage robust resource-constrained project scheduling problem. Comput. Oper. Res. 130: 105232 (2021)
• 
  Robert L. Burdett, Paul Corry, Colin Murray Eustace:
  Stockpile scheduling with geometry constraints in dry bulk terminals. Comput. Oper. Res. 130: 105224 (2021)
• 
  Leopoldo Eduardo Cárdenas-Barrón, Rafael A. Melo, Marcio Costa Santos:
  Extended formulation and valid inequalities for the multi-item inventory lot-sizing problem with supplier selection. Comput. Oper. Res. 130: 105234 (2021)
• 
  Yuxin Che, Kanxin Hu, Zhenzhen Zhang, Andrew Lim:
  Machine scheduling with orientation selection and two-dimensional packing for additive manufacturing. Comput. Oper. Res. 130: 105245 (2021)
• 
  Banu Yetkin Ekren, Sachin Kumar Mangla, Ecem Eroglu Turhanlar, Yigit Kazançoglu, Guo Li:
  Lateral inventory share-based models for IoT-enabled E-commerce sustainable food supply networks. Comput. Oper. Res. 130: 105237 (2021)
• 
  Sergey S. Ketkov, Oleg A. Prokopyev, Evgenii P. Burashnikov:
  An approach to the distributionally robust shortest path problem. Comput. Oper. Res. 130: 105212 (2021)
• 
  Ahmed Kheiri, Angeliki Gretsista, Ed Keedwell, Guglielmo Lulli, Michael G. Epitropakis, Edmund K. Burke:
  A hyper-heuristic approach based upon a hidden Markov model for the multi-stage nurse rostering problem. Comput. Oper. Res. 130: 105221 (2021)
• 
  Yun Hui Lin, Qingyun Tian:
  Generalized Benders decomposition for competitive facility location with concave demand and zone-specialized variable attractiveness. Comput. Oper. Res. 130: 105236 (2021)
• 
  Ivana Ljubic, Ahlam Mouaci, Nancy Perrot, Éric Gourdin:
  Benders decomposition for a node-capacitated Virtual Network Function placement and routing problem. Comput. Oper. Res. 130: 105227 (2021)
• 
  Golshan Madraki, Robert P. Judd:
  Accelerating the calculation of makespan used in scheduling improvement heuristics. Comput. Oper. Res. 130: 105233 (2021)
• 
  Muchen Wen, Jun Lin, Yanjun Qian, Weihao Huang:
  Scheduling interrelated activities in complex projects under high-order rework: A DSM-based approach. Comput. Oper. Res. 130: 105246 (2021)
• 
  Chia-Huang Wu, Dong-Yuh Yang:
  Bi-objective optimization of a queueing model with two-phase heterogeneous service. Comput. Oper. Res. 130: 105230 (2021)