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

• 2014
• 
  Mojtaba Araghi, Oded Berman, Igor Averbakh:
  Minisum multipurpose trip location problem on trees. Networks 63(2): 154-159 (2014)
• 
  Claudia Archetti, Nicola Bianchessi, Maria Grazia Speranza, Alain Hertz:
  The split delivery capacitated team orienteering problem. Networks 63(1): 16-33 (2014)
• 
  Claudia Archetti, Nicola Bianchessi, Maria Grazia Speranza, Alain Hertz:
  Incomplete service and split deliveries in a routing problem with profits. Networks 63(2): 135-145 (2014)
• 
  Igor Averbakh, Oded Berman, Dmitry Krass, Jörg Kalcsics, Stefan Nickel:
  Cooperative covering problems on networks. Networks 63(4): 334-349 (2014)
• 
  Enrique Benavent, Angel Corberán, Guy Desaulniers, François Lessard, Isaac Plana, José M. Sanchis:
  A branch-price-and-cut algorithm for the min-max k-vehicle windy rural postman problem. Networks 63(1): 34-45 (2014)
• 
  André Berger, Alexander Grigoriev, Ruben van der Zwaan:
  Complexity and approximability of the k-way vertex cut. Networks 63(2): 170-178 (2014)
• 
  Natashia Boland, Reena Kapoor, Simranjit Kaur, Thomas Kalinowski:
  Scheduling unit time arc shutdowns to maximize network flow over time: Complexity results. Networks 63(2): 196-202 (2014)
• 
  Endre Boros, Pinar Heggernes, Pim van 't Hof, Martin Milanic:
  Vector connectivity in graphs. Networks 63(4): 277-285 (2014)
• 
  Jason I. Brown, Danielle Cox:
  Nonexistence of optimal graphs for all terminal reliability. Networks 63(2): 146-153 (2014)
• 
  Ann Melissa Campbell, Jill Hardin Wilson:
  Forty years of periodic vehicle routing. Networks 63(1): 2-15 (2014)
• 
  Ann Melissa Campbell, Jill Hardin Wilson:
  Forty years of periodic vehicle routing. Networks 63(3): 276 (2014)
• 
  Gianlorenzo D'Angelo, Mattia D'Emidio, Daniele Frigioni:
  Fully dynamic update of arc-flags. Networks 63(3): 243-259 (2014)
• 
  Michael Drexl:
  Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments. Networks 63(1): 119-133 (2014)
• 
  Dominique Feillet, Thierry Garaix, Fabien Lehuédé, Olivier Péton, Dominique Quadri:
  A new consistent vehicle routing problem for the transportation of people with disabilities. Networks 63(3): 211-224 (2014)
• 
  Stefan Gollowitzer, Luis Eduardo Neves Gouveia, Gilbert Laporte, Dilson Lucas Pereira, Adam Wojciechowski:
  A comparison of several models for the hamiltonian p-median problem. Networks 63(4): 350-363 (2014)
• 
  Minh Hoàng Hà, Nathalie Bostel, André Langevin, Louis-Martin Rousseau:
  Solving the close-enough arc routing problem. Networks 63(1): 107-118 (2014)
• 
  Hipólito Hernández-Pérez, Juan José Salazar González:
  The multi-commodity pickup-and-delivery traveling salesman problem. Networks 63(1): 46-59 (2014)
• 
  In-Jae Kim, Brian P. Barthel, Yuyoung Park, Jordan R. Tait, Joseph L. Dobmeier, Sung Kim, Dooyoung Shin:
  Network analysis for active and passive propagation models. Networks 63(2): 160-169 (2014)
• 
  Masayuki Kobayashi, Yoshio Okamoto:
  Submodularity of minimum-cost spanning tree games. Networks 63(3): 231-238 (2014)
• 
  Attila A. Kovacs, Sophie N. Parragh, Richard F. Hartl:
  A template-based adaptive large neighborhood search for the consistent vehicle routing problem. Networks 63(1): 60-81 (2014)
• 
  Xiang-Jun Li, Jun-Ming Xu:
  Generalized measures for fault tolerance of star networks. Networks 63(3): 225-230 (2014)
• 
  Ahmad Moradi, Andrea Lodi, S. Mehdi Hashemi:
  On the difficulty of virtual private network instances. Networks 63(4): 327-333 (2014)
• 
  Pamela C. Nolz, Nabil Absi, Dominique Feillet:
  A stochastic inventory routing problem for infectious medical waste collection. Networks 63(1): 82-95 (2014)
• 
  Sarah G. Nurre, Thomas C. Sharkey:
  Integrated network design and scheduling problems with parallel identical machines: Complexity results and dispatching rules. Networks 63(4): 306-326 (2014)
• 
  Fabiano de S. Oliveira, Valmir Carneiro Barbosa:
  Revisiting deadlock prevention: A probabilistic approach. Networks 63(2): 203-210 (2014)
• 
  Jiani Qian, Richard W. Eglese:
  Finding least fuel emission paths in a network with time-varying speeds. Networks 63(1): 96-106 (2014)
• 
  Olivia J. Smith, Martin W. P. Savelsbergh:
  A note on shortest path problems with forbidden paths. Networks 63(3): 239-242 (2014)
• 
  Amit Verma, Ann Melissa Campbell:
  Strategic placement of telemetry to reduce routing costs. Networks 63(3): 260-275 (2014)
• 
  Chi Xie:
  Bicriterion discrete equilibrium network design problem. Networks 63(4): 286-305 (2014)
• 
  Zhou Xu, Xiaofan Lai, Andrew Lim, Fan Wang:
  An improved approximation algorithm for the capacitated TSP with pickup and delivery on a tree. Networks 63(2): 179-195 (2014)