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

• 2017
• 
  Wim van Ackooij, V. Berge, Welington de Oliveira, Claudia A. Sagastizábal:
  Probabilistic optimization via approximate p-efficient points and bundle methods. Comput. Oper. Res. 77: 177-193 (2017)
• 
  Mari Jevne Arnesen, Magnhild Gjestvang, Xin Wang, Kjetil Fagerholt, Kristian Thun, Jørgen Glomvik Rakke:
  A traveling salesman problem with pickups and deliveries, time windows and draft limits: Case study from chemical shipping. Comput. Oper. Res. 77: 20-31 (2017)
• 
  Peter Buchholz, Iryna Dohndorf, Dimitri Scheftelowitsch:
  Optimal decisions for continuous time Markov decision processes over finite planning horizons. Comput. Oper. Res. 77: 267-278 (2017)
• 
  Yuning Chen, Jin-Kao Hao:
  An iterated "hyperplane exploration" approach for the quadratic knapsack problem. Comput. Oper. Res. 77: 226-239 (2017)
• 
  Eduardo Conde:
  A minimum expected regret model for the shortest path problem with solution-dependent probability distributions. Comput. Oper. Res. 77: 11-19 (2017)
• 
  Victor Fernandez-Viagas, Jose M. Framiñan:
  Reduction of permutation flowshop problems to single machine problems using machine dominance relations. Comput. Oper. Res. 77: 96-110 (2017)
• 
  Christian Fikar, Patrick Hirsch:
  Home health care routing and scheduling: A review. Comput. Oper. Res. 77: 86-95 (2017)
• 
  Neda Karimi, Hamid Davoudpour:
  A knowledge-based approach for multi-factory production systems. Comput. Oper. Res. 77: 72-85 (2017)
• 
  Sebastian Koch:
  Least squares approximate policy iteration for learning bid prices in choice-based revenue management. Comput. Oper. Res. 77: 240-253 (2017)
• 
  Gültekin Kuyzu:
  Lane covering with partner bounds in collaborative truckload transportation procurement. Comput. Oper. Res. 77: 32-43 (2017)
• 
  Xiangyong Li, Kai Wei, Yash P. Aneja, Peng Tian, Youzhi Cui:
  Matheuristics for the single-path design-balanced service network design problem. Comput. Oper. Res. 77: 141-153 (2017)
• 
  Yousef Maknoon, Gilbert Laporte:
  Vehicle routing with cross-dock selection. Comput. Oper. Res. 77: 254-266 (2017)
• 
  Yves Molenbruch, Kris Braekers, An Caris, Greet Vanden Berghe:
  Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation. Comput. Oper. Res. 77: 58-71 (2017)
• 
  Lluís-Miquel Munguía, Shabbir Ahmed, David A. Bader, George L. Nemhauser, Vikas Goel, Yufen Shao:
  A parallel local search framework for the Fixed-Charge Multicommodity Network Flow problem. Comput. Oper. Res. 77: 44-57 (2017)
• 
  Omid Shahvari, Rasaratnam Logendran:
  An Enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes. Comput. Oper. Res. 77: 154-176 (2017)
• 
  Ankur Sinha, Pekka Malo, Kalyanmoy Deb:
  Approximated set-valued mapping approach for handling multiobjective bilevel problems. Comput. Oper. Res. 77: 194-209 (2017)
• 
  Sandeep Srivathsan, Manjunath Kamath:
  Performance modeling of a two-echelon supply chain under different levels of upstream inventory information sharing. Comput. Oper. Res. 77: 210-225 (2017)
• 
  Mehmet Fatih Tasgetiren, Damla Kizilay, Quan-Ke Pan, Ponnuthurai N. Suganthan:
  Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion. Comput. Oper. Res. 77: 111-126 (2017)
• 
  Marjolein Veenstra, Marilène Cherkesly, Guy Desaulniers, Gilbert Laporte:
  The pickup and delivery problem with time windows and handling operations. Comput. Oper. Res. 77: 127-140 (2017)
• 
  Yang Wang, Abraham P. Punnen:
  The boolean quadratic programming problem with generalized upper bound constraints. Comput. Oper. Res. 77: 1-10 (2017)