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

• 2024
• 
  Tommaso Adamo, Gianpaolo Ghiani, Emanuela Guerriero:
  Real-time schedule adjustments for conflict-free vehicle routing. Comput. Oper. Res. 166: 106625 (2024)
• 
  Harry Aguilar, Alberto García-Villoria, Rafael Pastor:
  Heuristic and metaheuristic procedures for the Parallel Assembly Lines Balancing Problem with multi-line workstations and buffer sizing. Comput. Oper. Res. 166: 106596 (2024)
• 
  Kenza Alioui, Karim Amrouche, Mourad Boudhar:
  Reentrant open shop scheduling problem with time lags and no-wait constraints. Comput. Oper. Res. 166: 106595 (2024)
• 
  Eduardo Álvarez-Miranda, Jordi Pereira, Mariona Vilà:
  A branch, bound and remember algorithm for maximizing the production rate in the simple assembly line balancing problem. Comput. Oper. Res. 166: 106597 (2024)
• 
  Tamara Bigler:
  A matheuristic for locating obnoxious facilities. Comput. Oper. Res. 166: 106602 (2024)
• 
  David Canca, Eva Barrena, Gilbert Laporte:
  Arrival and service time dependencies in the single- and multi-visit selective traveling salesman problem. Comput. Oper. Res. 166: 106632 (2024)
• 
  Francesco Carrabs, Raffaele Cerulli, Renata Mansini, Lorenzo Moreschini, Domenico Serra:
  Solving the Set Covering Problem with Conflicts on Sets: A new parallel GRASP. Comput. Oper. Res. 166: 106620 (2024)
• 
  Ada Che, Jing Li, Feng Chu, Chengbin Chu:
  Optimizing emergency supply pre-positioning for disaster relief: A two-stage distributionally robust approach. Comput. Oper. Res. 166: 106607 (2024)
• 
  Mao Chen, Yajing Yang, Zeyu Zeng, Xiangyang Tang, Xicheng Peng, Sannuya Liu:
  A filtered beam search based heuristic algorithm for packing unit circles into a circular container. Comput. Oper. Res. 166: 106636 (2024)
• 
  Hanna Furmanczyk, Tytus Pikies, Inka Sokolowska, Krzysztof Turowski:
  Approximation algorithms for job scheduling with block-type conflict graphs. Comput. Oper. Res. 166: 106606 (2024)
• 
  Eduardo A. Alarcón Gerbier, Udo Buscher:
  The dynamic facility location problem with mobile production units: A waste recycling application. Comput. Oper. Res. 166: 106609 (2024)
• 
  Marc Goerigk, Mohammad Khosravi:
  Benchmarking problems for robust discrete optimization. Comput. Oper. Res. 166: 106608 (2024)
• 
  Celia Jiménez-Piqueras, Consuelo Parreño-Torres, Ramón Alvarez-Valdés, Rubén Ruiz:
  The container premarshalling problem under limited crane time: A constraint programming approach. Comput. Oper. Res. 166: 106635 (2024)
• 
  Amélie Lambert:
  A tight compact quadratically constrained convex relaxation of the Optimal Power Flow problem. Comput. Oper. Res. 166: 106626 (2024)
• 
  Xue Li, Zhengwen He, Nengmin Wang:
  A branch-and-bound algorithm for the proactive resource-constrained project scheduling problem with a robustness maximization objective. Comput. Oper. Res. 166: 106623 (2024)
• 
  Enhao Liu, Tengmu Hu, Theodore T. Allen, Christoph Hermes:
  Optimal classification trees with leaf-branch and binary constraints. Comput. Oper. Res. 166: 106629 (2024)
• 
  Chang Lv, Qiong Liu, Chaoyong Zhang, Yaping Ren, Hao Zhou:
  A feature correlation reinforce clustering and evolutionary algorithm for the green bike-sharing reposition problem. Comput. Oper. Res. 166: 106627 (2024)
• 
  Baruch Mor, Gur Mosheiov:
  Due-Date assignment with acceptable lead-times on parallel machines. Comput. Oper. Res. 166: 106617 (2024)
• 
  Nazanin Nezami, Hadis Anahideh:
  Dynamic Exploration-Exploitation Pareto Approach for high-dimensional expensive black-box optimization. Comput. Oper. Res. 166: 106619 (2024)
• 
  Alfredo Oneto, Álvaro Lorca, Elisa Ferrario, Alan Poulos, Juan Carlos de la Llera, Matías Negrete-Pincetic:
  Data-driven optimization for seismic-resilient power network planning. Comput. Oper. Res. 166: 106628 (2024)
• 
  Kaan Pekel, Yilmazcan Özyurt, Baris Yildiz, Ali K. Dogru:
  A branch-and-cut approach to solve the Fault Diagnosis Problem with Lazy Spread and imperfect system information. Comput. Oper. Res. 166: 106598 (2024)
• 
  Bo Peng, Lunwen Wu, Rafael Martí, Jiangshui Ma:
  A fast path relinking algorithm for the min-max edge crossing problem. Comput. Oper. Res. 166: 106603 (2024)
• 
  Laio Oriel Seman, Cezar Antônio Rigo, Eduardo Camponogara, Eduardo Augusto Bezerra:
  Benders decomposition for the energy aware task scheduling of constellations of nanosatellites. Comput. Oper. Res. 166: 106618 (2024)
• 
  Baofeng Tian, Jingwen Zhang, Erik Demeulemeester, Hao Liu:
  A chance-constrained optimization approach integrating project scheduling and material ordering to manage the uncertain material supply. Comput. Oper. Res. 166: 106624 (2024)
• 
  Hua Wang, Chunguang Bai, Benjamin Lev, Wei Chen:
  Quick response under strategic consumers with high-price and stockout regrets. Comput. Oper. Res. 166: 106590 (2024)
• 
  Xiaoyang Zhou, Tingting Guo, Shouyang Wang, Benjamin Lev, Zhe Zhang:
  Drone-based hybrid charging for multiple sensors: A distributionally robust optimization approach. Comput. Oper. Res. 166: 106621 (2024)