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

• 2013
• 
  Pablo Adasme, Rafael Andrade, Marc Letournel, Abdel Lisser:
  A polynomial formulation for the stochastic maximum weight forest problem. Electron. Notes Discret. Math. 41: 29-36 (2013)
• 
  Hasan Murat Afsar, Nacima Labadie:
  Team Orienteering Problem with Decreasing Profits. Electron. Notes Discret. Math. 41: 285-293 (2013)
• 
  Agostinho Agra, Mahdi Doostmohammadi, Cid Carvalho de Souza:
  Intersecting a simple mixed integer set with a vertex packing set. Electron. Notes Discret. Math. 41: 327-334 (2013)
• 
  Hanane Allaoua, Sylvie Borne, Lucas Létocart, Roberto Wolfler Calvo:
  A matheuristic approach for solving a home health care problem. Electron. Notes Discret. Math. 41: 471-478 (2013)
• 
  Edoardo Amaldi, Stefano Coniglio, Luca Giovanni Gianoli, Can Umut Ileri:
  On single-path network routing subject to max-min fair flow allocation. Electron. Notes Discret. Math. 41: 543-550 (2013)
• 
  Rafael Castro de Andrade, Adriano Tavares de Freitas:
  Disjunctive combinatorial branch in a subgradient tree algorithm for the DCMST problem with VNS-Lagrangian bounds. Electron. Notes Discret. Math. 41: 5-12 (2013)
• 
  Francisco Ángel-Bello, Iris Martínez-Salazar, Ada M. Alvarez:
  Minimizing waiting times in a route design problem with multiple use of a single vehicle. Electron. Notes Discret. Math. 41: 269-276 (2013)
• 
  Idil Arsik, F. Sibel Salman:
  Modeling Earthquake Vulnerability of Highway Networks. Electron. Notes Discret. Math. 41: 319-326 (2013)
• 
  Mohamad Assaad, Walid Ben-Ameur, Faiz Hamid:
  An Interval Assignment Problem for Resource Optimization in LTE Networks. Electron. Notes Discret. Math. 41: 237-244 (2013)
• 
  Pierre-Olivier Bauguion, Walid Ben-Ameur, Éric Gourdin:
  A new model for multicommodity flow problems, and a strongly polynomial algorithm for single-source Maximum Concurrent Flow. Electron. Notes Discret. Math. 41: 311-318 (2013)
• 
  Walid Ben-Ameur, Mateusz Zotkiewicz:
  Multipolar routing: where dynamic and static routing meet. Electron. Notes Discret. Math. 41: 61-68 (2013)
• 
  Amal Benhamiche, Ali Ridha Mahjoub, Nancy Perrot, Eduardo Uchoa:
  Capacitated Network Design using Bin-Packing. Electron. Notes Discret. Math. 41: 479-486 (2013)
• 
  Andreas Bley, S. Mehdi Hashemi, Mohsen Rezapour:
  IP modeling of the survivable hop constrained connected facility location problem. Electron. Notes Discret. Math. 41: 463-470 (2013)
• 
  Andreas Bley, Daniel Karch, Fabio D'Andreagiovanni:
  WDM Fiber Replacement Scheduling. Electron. Notes Discret. Math. 41: 189-196 (2013)
• 
  Adrian Bock, Laura Sanità:
  On the approximability of two capacitated vehicle routing problems. Electron. Notes Discret. Math. 41: 519-526 (2013)
• 
  Ralf Borndörfer, Julia Buwaya, Guillaume Sagnol, Elmar Swarat:
  Optimizing Toll Enforcement in Transportation Networks: a Game-Theoretic Approach. Electron. Notes Discret. Math. 41: 253-260 (2013)
• 
  Sylvie Borne, Ali Ridha Mahjoub, Raouia Taktak:
  A branch-and-cut algorithm for the Multiple Steiner TSP with Order constraints. Electron. Notes Discret. Math. 41: 487-494 (2013)
• 
  Valentina Cacchiani, Juan José Salazar González:
  A heuristic approach for an integrated fleet-assignment, aircraft-routing and crew-pairing problem. Electron. Notes Discret. Math. 41: 391-398 (2013)
• 
  Paola Cappanera, Maria Grazia Scutellà:
  Home Care optimization: impact of pattern generation policies on scheduling and routing decisions. Electron. Notes Discret. Math. 41: 53-60 (2013)
• 
  Fabián Castaño, André Rossi, Marc Sevaux, Nubia Velasco:
  On the use of multiple sinks to extend the lifetime in connected wireless sensor networks. Electron. Notes Discret. Math. 41: 77-84 (2013)
• 
  Richard Li-Yang Chen, Cynthia A. Phillips:
  k-Edge Failure Resilient Network Design. Electron. Notes Discret. Math. 41: 375-382 (2013)
• 
  Jianqiang Cheng, Abdel Lisser, Marc Letournel:
  Distributionally robust stochastic shortest path problem. Electron. Notes Discret. Math. 41: 511-518 (2013)
• 
  Markus Chimani, Maria Kandyba, Maren Martens:
  2-InterConnected Facility Location: Specification, Complexity, and Exact Solutions. Electron. Notes Discret. Math. 41: 21-28 (2013)
• 
  Sergio Consoli, José Andrés Moreno-Pérez, Nenad Mladenovic:
  Intelligent variable neighbourhood search for the minimum labelling spanning tree problem. Electron. Notes Discret. Math. 41: 399-406 (2013)
• 
  Alberto Coppi, Paolo Detti, Jessica Raffaelli:
  A planning and routing model for patient transportation in health care. Electron. Notes Discret. Math. 41: 125-132 (2013)
• 
  Alessandra Cornaro, Gian Paolo Clemente:
  A New Lower Bound for the Kirchhoff Index using a numerical procedure based on Majorization Techniques. Electron. Notes Discret. Math. 41: 383-390 (2013)
• 
  Ibrahima Diarrassouba, Hakan Kutucu, Ali Ridha Mahjoub:
  Two Node-Disjoint 3-Hop-Constrained Survivable Network Design and Polyhedra. Electron. Notes Discret. Math. 41: 551-558 (2013)
• 
  Elena Fernández, Carlos Luna-Mota, Achim Hildenbrandt, Gerhard Reinelt, Stefan Wiesberg:
  A Flow Formulation for the Optimum Communication Spanning Tree. Electron. Notes Discret. Math. 41: 85-92 (2013)
• 
  Vinicius Leal do Forte, Abilio Lucena, Nelson Maculan:
  Formulations for the Minimum 2-Connected Dominating Set Problem. Electron. Notes Discret. Math. 41: 415-422 (2013)
• 
  Bernard Fortz, Martine Labbé, Alessia Violin:
  Dantzig-Wolfe Reformulation for the Network Pricing Problem with Connected Toll Arcs. Electron. Notes Discret. Math. 41: 117-124 (2013)

skipping 41 more matches