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

• 2011
• 
  Bernardetta Addis, Giuliana Carello, Federico Malucelli:
  SRG-Disjoint Design with Dedicated and Shared Protection. INOC 2011: 18-23
• 
  Agostinho Agra, Adelaide Cerveira, Cristina Requejo, Eulália Santos:
  On the Weight-Constrained Minimum Spanning Tree Problem. INOC 2011: 156-161
• 
  Edoardo Amaldi, Maurizio Bruglieri, Bernard Fortz:
  On the Hazmat Transport Network Design Problem. INOC 2011: 327-338
• 
  Edoardo Amaldi, Antonio Capone, Luca Giovanni Gianoli, Luca Mascetti:
  A MILP-Based Heuristic for Energy-Aware Traffic Engineering with Shortest Path Routing. INOC 2011: 464-477
• 
  Isabel Amigo, Sandrine Vaton, Thierry Chonavel, Federico Larroca:
  Maximum Delay Computation under Traffic Matrix Uncertainty and Its Application to Interdomain Path Selection. INOC 2011: 182-195
• 
  Ashwin Arulselvan, Andreas Bley, Stefan Gollowitzer, Ivana Ljubic, Olaf Maurer:
  MIP Modeling of Incremental Connected Facility Location. INOC 2011: 490-502
• 
  Amal Benhamiche, Ali Ridha Mahjoub, Nancy Perrot:
  On the Design of Optical OFDM-Based Networks. INOC 2011: 1-6
• 
  María Elisa Bertinat, Darío Padula, Franco Robledo Amoza, Pablo Rodríguez-Bocca, Pablo Romero:
  Optimal Bandwidth Allocation in Mesh-Based Peer-to-Peer Streaming Networks. INOC 2011: 529-534
• 
  Sylvie Borne, Virginie Gabrel, Ali Ridha Mahjoub, Raouia Taktak:
  Multilayer Survivable Optical Network Design. INOC 2011: 170-175
• 
  Mustapha Bouhtou, Jean-Robin Medori, Michel Minoux:
  Mixed Integer Programming Model for Pricing in Telecommunication. INOC 2011: 626-630
• 
  Maurizio Bruglieri, Paola Cappanera, Alberto Colorni, Maddalena Nonato:
  Modeling the Gateway Location Problem for Multicommodity Flow Rerouting. INOC 2011: 262-276
• 
  Christoph Buchheim, Frauke Liers, Laura Sanità:
  An Exact Algorithm for Robust Network Design. INOC 2011: 7-17
• 
  Christina Büsing, Arie M. C. A. Koster, Manuel Kutschka:
  Recoverable Robust Knapsacks: Γ-Scenarios. INOC 2011: 583-588
• 
  Mikael Call, Kaj Holmberg:
  Complexity of Inverse Shortest Path Routing. INOC 2011: 339-353
• 
  Roberto Wolfler Calvo, Nora Touati Moungla:
  A Matheuristic for the Dial-a-Ride Problem. INOC 2011: 450-463
• 
  Paola Cappanera, Luis Eduardo Neves Gouveia, Maria Grazia Scutellà:
  The Skill Vehicle Routing Problem. INOC 2011: 354-364
• 
  Francesco Carrabs, Raffaele Cerulli, Monica Gentili, Gennaro Parlato:
  A Tabu Search Heuristic Based on k-Diamonds for the Weighted Feedback Vertex Set Problem. INOC 2011: 589-602
• 
  Paula Carroll, Bernard Fortz, Martine Labbé, Seán McGarraghy:
  Improved Formulations for the Ring Spur Assignment Problem. INOC 2011: 24-36
• 
  Matthieu Chardy, Cédric Hervet:
  FTTH Network Design under OA&M Constraints. INOC 2011: 98-104
• 
  Grit Claßen, David Coudert, Arie M. C. A. Koster, Napoleão Nepomuceno:
  A Chance-Constrained Model and Cutting Planes for Fixed Broadband Wireless Networks. INOC 2011: 37-42
• 
  David Coudert, Napoleão Nepomuceno, Issam Tahiri:
  Energy Saving in Fixed Wireless Broadband Networks. INOC 2011: 484-489
• 
  Alexandre Salles da Cunha, Luidi Simonetti, Abilio Lucena:
  Formulations and Branch-and-Cut Algorithm for the K-rooted Mini-Max Spanning Forest Problem. INOC 2011: 43-50
• 
  Fabio D'Andreagiovanni, Carlo Mannino, Antonio Sassano:
  Negative Cycle Separation in Wireless Network Design. INOC 2011: 51-56
• 
  Paolo Dell'Olmo, Antonino Sgalambro:
  The Spatially Equitable Multicommodity Capacitated Network Flow Problem. INOC 2011: 196-209
• 
  M. Reza Emamy-Khansary:
  Cuts, c-Cuts, and c-Complexes over the n-Cube. INOC 2011: 603-606
• 
  Giulia Galbiati:
  Approximating Minimum Cut with Bounded Size. INOC 2011: 210-215
• 
  Haris Gavranovic, Mirsad Buljubasic:
  Efficient Robust Linear Optimization for Large Repositioning Problems. INOC 2011: 553-558
• 
  Martin Josef Geiger, Marc Sevaux:
  The Biobjective Inventory Routing Problem - Problem Solution and Decision Support. INOC 2011: 365-378
• 
  Asvin Goel:
  Problem Transformations for Vehicle Routing and Scheduling in the European Union. INOC 2011: 379-384
• 
  Boris Goldengorin, Dmitry Krushinsky:
  A Computational Study of the Pseudo-Boolean Approach to the p-Median Problem Applied to Cell Formation. INOC 2011: 503-516

skipping 44 more matches