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

• 2020
• 
  Massinissa Ait Aba, Lilia Zaourar, Alix Munier:
  Polynomial Scheduling Algorithm for Parallel Applications on Hybrid Platforms. ISCO 2020: 143-155
• 
  Hassene Aissi, Ali Ridha Mahjoub:
  On the Linear Relaxation of the s-t-cut Problem with Budget Constraints. ISCO 2020: 81-88
• 
  Gabriela R. Argiroffo, Silvia M. Bianchi, Yanina Lucarini, Annegret Wagler:
  Polyhedra Associated with Open Locating-Dominating and Locating Total-Dominating Sets in Graphs. ISCO 2020: 3-14
• 
  Mourad Baïou, Francisco Barahona:
  On the p-Median Polytope and the Directed Odd Cycle Inequalities. ISCO 2020: 15-26
• 
  Michele Barbato, Roland Grappe, Mathieu Lacroix, Emiliano Lancini:
  On k-edge-connected Polyhedra: Box-TDIness in Series-Parallel Graphs. ISCO 2020: 27-41
• 
  Pascale Bendotti, Philippe Chrétienne, Pierre Fouilhoux, Adèle Pass-Lanneau:
  Anchored Rescheduling Problems Under Generalized Precedence Constraints. ISCO 2020: 156-166
• 
  Kristóf Bérczi, Tamás Király, Simon Omlor:
  Scheduling with Non-renewable Resources: Minimizing the Sum of Completion Times. ISCO 2020: 167-178
• 
  Fritz Bökler, Markus Chimani, Mirko H. Wagner, Tilo Wiedera:
  An Experimental Study of ILP Formulations for the Longest Induced Path Problem. ISCO 2020: 89-101
• 
  Raffaele Cerulli, Ciriaco D'Ambrosio, Andrea Raiconi, Gaetano Vitale:
  The Knapsack Problem with Forfeits. ISCO 2020: 263-272
• 
  Rui Chen, Sanjeeb Dash, Oktay Günlük:
  Cardinality Constrained Multilinear Sets. ISCO 2020: 54-65
• 
  Claudia D'Ambrosio, Jon Lee, Daphne E. Skipper, Dimitri Thomopulos:
  Handling Separable Non-convexities Using Disjunctive Cuts. ISCO 2020: 102-114
• 
  Pedro Diniz, Rafael Martinelli, Marcus Poggi:
  An Efficient Matheuristic for the Inventory Routing Problem. ISCO 2020: 273-285
• 
  Antonio Frangioni, Bernard Gendron, Enrico Gorgone:
  Quasi-Separable Dantzig-Wolfe Reformulations for Network Design. ISCO 2020: 227-236
• 
  Gabriel Homsi, Bernard Gendron, Sanjay Dominik Jena:
  Dynamic and Stochastic Rematching for Ridesharing Systems: Formulations and Reductions. ISCO 2020: 193-201
• 
  Jon Lee, Joseph Paat, Ingo Stallknecht, Luze Xu:
  Improving Proximity Bounds Using Sparsity. ISCO 2020: 115-127
• 
  Péter Madarasi:
  The Distance Matching Problem. ISCO 2020: 202-213
• 
  Yuya Masumura, Taihei Oki, Yutaro Yamaguchi:
  Dynamic Programming Approach to the Generalized Minimum Manhattan Network Problem. ISCO 2020: 237-248
• 
  Mayssoun Messaoudi, Issmail El Hallaoui, Louis-Martin Rousseau, Adil Tahir:
  Solving a Real-World Multi-attribute VRP Using a Primal-Based Approach. ISCO 2020: 286-296
• 
  Flávio Keidi Miyazawa, Phablo F. S. Moura, Matheus Jun Ota, Yoshiko Wakabayashi:
  Cut and Flow Formulations for the Balanced Connected k-Partition Problem. ISCO 2020: 128-139
• 
  Chaghoub Soraya, Ibrahima Diarrassouba:
  A Polyhedral Study for the Buy-at-Bulk Facility Location Problem. ISCO 2020: 42-53
• 
  Kenjiro Takazawa:
  Notes on Equitable Partitions into Matching Forests in Mixed Graphs and b-branchings in Digraphs. ISCO 2020: 214-224
• 
  Raouia Taktak, Eduardo Uchoa:
  On the Multiple Steiner Traveling Salesman Problem with Order Constraints. ISCO 2020: 66-77
• 
  Renan Spencer Trindade, Olinto C. B. de Araújo, Marcia Fampa:
  Arc-Flow Approach for Parallel Batch Processing Machine Scheduling with Non-identical Job Sizes. ISCO 2020: 179-190
• 
  Piotr Wojciechowski, Matthew D. Williamson, K. Subramani:
  On Finding Shortest Paths in Arc-Dependent Networks. ISCO 2020: 249-260
• 
  Mourad Baïou, Bernard Gendron, Oktay Günlük, Ali Ridha Mahjoub:
  Combinatorial Optimization - 6th International Symposium, ISCO 2020, Montreal, QC, Canada, May 4-6, 2020, Revised Selected Papers. Lecture Notes in Computer Science 12176, Springer 2020, ISBN 978-3-030-53261-1 [contents]