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

• 2023
• 
  Saurav Agarwal, Srinivas Akella:
  The single robot line coverage problem: Theory, algorithms, and experiments. Networks 82(4): 479-505 (2023)
• 
  Pasquale Avella, Alice Calamita, Laura Palagi:
  A compact formulation for the base station deployment problem in wireless networks. Networks 82(1): 52-67 (2023)
• 
  Igor Averbakh, Wei Yu:
  The probabilistic uncapacitated open vehicle routing location problem. Networks 82(1): 68-83 (2023)
• 
  Michele Barbato, Francisco Canas, Luís Gouveia, Pierre Pesneau:
  Node based compact formulations for the Hamiltonian p-median problem. Networks 82(4): 336-370 (2023)
• 
  Fábio Barbosa, Amaro de Sousa, Agostinho Agra:
  Provision of maximum connectivity resiliency with minimum cost to telecommunication networks through third-party networks. Networks 82(2): 87-110 (2023)
• 
  Cédric Bentz, Marie-Christine Costa, Pierre-Louis Poirion, Thomas Ridremont:
  Robust capacitated Steiner trees and networks with uniform demands. Networks 82(1): 3-31 (2023)
• 
  Maurizio Boccia, Andrea Mancuso, Adriano Masone, Claudio Sterle:
  A new MILP formulation for the flying sidekick traveling salesman problem. Networks 82(3): 254-276 (2023)
• 
  Jason I. Brown, Isaac McMullin:
  On the split reliability of graphs. Networks 82(2): 177-185 (2023)
• 
  Hugo Callebaut, Jérôme De Boeck, Bernard Fortz:
  Preprocessing for segment routing optimization. Networks 82(4): 459-478 (2023)
• 
  James F. Campbell, Ángel Corberán, Isaac Plana, José M. Sanchis, Paula Segura:
  The multi-purpose K-drones general routing problem. Networks 82(4): 437-458 (2023)
• 
  Francesco Carrabs, Raffaele Cerulli, Federica Laureana, Domenico Serra, Carmine Sorgente:
  A genetic approach for the 2-edge-connected minimum branch vertices problem. Networks 82(4): 301-317 (2023)
• 
  Pedro Maristany de las Casas, Luitgard Kraus, Antonio Sedeño-Noda, Ralf Borndörfer:
  Targeted multiobjective Dijkstra algorithm. Networks 82(3): 277-298 (2023)
• 
  Sheng-Jie Chen, Weikun Chen, Yu-Hong Dai, Jian-Hua Yuan, Hou-Shan Zhang:
  Efficient presolving methods for the influence maximization problem. Networks 82(3): 229-253 (2023)
• 
  Oliverio Cruz-Mejia, Adam N. Letchford:
  A survey on exact algorithms for the maximum flow and minimum-cost flow problems. Networks 82(2): 167-176 (2023)
• 
  Nho Minh Dinh, Claudia Archetti, Luca Bertazzi:
  The inventory routing problem with split deliveries. Networks 82(4): 400-413 (2023)
• 
  Masoud Eshghali, Pavlo A. Krokhmal:
  Risk-averse optimization and resilient network flows. Networks 82(2): 129-152 (2023)
• 
  Josep Fàbrega, Jaume Martí-Farré, Xavier Muñoz:
  Distance-layer structure of the De Bruijn and Kautz digraphs: Analysis and application to deflection routing. Networks 82(4): 527-550 (2023)
• 
  Farnaz Farzadnia, Tolga Bektas, Jens Lysgaard:
  The cumulative school bus routing problem: Polynomial-size formulations. Networks 82(4): 571-591 (2023)
• 
  Elena Fernández, Isabella Lari, Justo Puerto, Federica Ricca, Andrea Scozzari:
  Connected graph partitioning with aggregated and non-aggregated gap objective functions. Networks 82(4): 551-570 (2023)
• 
  Elisabeth Gaar, Markus Sinnl:
  Exact solution approaches for the discrete α-neighbor p-center problem. Networks 82(4): 371-399 (2023)
• 
  Nili Guttmann-Beck, Hadas Meshita-Sayag, Michal Stern:
  Achieving feasibility for clustered traveling salesman problems using PQ-trees. Networks 82(2): 153-166 (2023)
• 
  Pengfei He, Jin-Kao Hao, Qinghua Wu:
  Hybrid genetic algorithm for undirected traveling salesman problems with profits. Networks 82(3): 189-221 (2023)
• 
  Gabriel Homsi, Bernard Gendron, Sanjay Dominik Jena:
  Two-stage stochastic one-to-many driver matching for ridesharing. Networks 82(4): 414-436 (2023)
• 
  Marilena Jianu, Leonard Daus, Vlad-Florin Dragoi, Valeriu Beiu:
  Reliability polynomials of consecutive-k-out-of-n:Fsystems have unbounded roots. Networks 82(3): 222-228 (2023)
• 
  Rico Kötschau, Ninja Soeffker, Jan Fabian Ehmke:
  Mobile parcel lockers with individual customer service. Networks 82(4): 506-526 (2023)
• 
  Kyle MacKeigan, Danielle Cox, Emily Wright:
  Existence of optimally-greatest digraphs for strongly connected node reliability. Networks 82(2): 111-128 (2023)
• 
  Xabier Martin, Javier Panadero, David Peidro, Elena Pérez-Bernabeu, Angel A. Juan:
  Solving the time capacitated arc routing problem under fuzzy and stochastic travel and service times. Networks 82(4): 318-335 (2023)
• 
  Ahlam Mouaci, Éric Gourdin, Ivana Ljubic, Nancy Perrot:
  Two extended formulations for the virtual network function placement and routing problem. Networks 82(1): 32-51 (2023)
• 
  Issue Information. Networks 82(1): 1-2 (2023)
• 
  Issue Information. Networks 82(2): 85-86 (2023)

skipping 2 more matches