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

• 2024
• 
  Giuseppe Lancia, Marcello Dalpasso:
  Algorithmic strategies for a fast exploration of the TSP 4-OPT neighborhood. J. Heuristics 30(3-4): 109-144 (2024)
• 
  Giuseppe Lancia, Paolo Vidoni:
  Algorithmic strategies for finding the best TSP 2-OPT move in average sub-quadratic time. CoRR abs/2403.19878 (2024)
• 2023
• 
  Giuseppe Lancia, Marcello Dalpasso:
  Orbits, schemes and dynamic programming procedures for the TSP 4-OPT neighborhood. CoRR abs/2303.14424 (2023)
• 2021
• 
  Giuseppe Lancia, Paolo Serafini:
  Computational Complexity and ILP Models for Pattern Problems in the Logical Analysis of Data. Algorithms 14(8): 235 (2021)
• 2020
• 
  Giuseppe Lancia, Marcello Dalpasso:
  Finding the Best 3-OPT Move in Subcubic Time. Algorithms 13(11): 306 (2020)
• 
  Giuseppe Lancia, Paolo Vidoni:
  Finding the largest triangle in a graph in expected quadratic time. Eur. J. Oper. Res. 286(2): 458-467 (2020)
• 
  Giuseppe Lancia, Eleonora Pippia, Franca Rinaldi:
  Using Integer Programming to Search for Counterexamples: A Case Study. MOTOR 2020: 69-84
• 
  Robert D. Carr, Jennifer Iglesias, Giuseppe Lancia, Benjamin Moseley:
  Symmetric Linear Programming Formulations for Minimum Cut with Applications to TSP. CoRR abs/2005.11912 (2020)
• 2019
• 
  Giuseppe Lancia, Marcello Dalpasso:
  <tt>FASTSET</tt>: A Fast Data Structure for the Representation of Sets of Integers. Algorithms 12(5): 91 (2019)
• 
  Giuseppe Lancia, Marcello Dalpasso:
  Speeding-Up the Dynamic Programming Procedure for the Edit Distance of Two Strings. DEXA Workshops 2019: 59-66
• 2018
• 
  Marcello Dalpasso, Giuseppe Lancia:
  New Modeling Ideas for the Exact Solution of the Closest String Problem. DEXA Workshops 2018: 105-114
• 2017
• 
  Giuseppe Lancia, Luke Mathieson, Pablo Moscato:
  Separating sets of strings by finding matching patterns is almost always hard. Theor. Comput. Sci. 665: 73-86 (2017)
• 2016
• 
  Giuseppe Lancia, Paolo Serafini:
  Deriving compact extended formulations via LP-based separation techniques. Ann. Oper. Res. 240(1): 321-350 (2016)
• 
  Michele Punzo, Chiara Lanciano, Daniela Tarallo, Francesco Bianco, Giuseppe Cavuoto, Rosanna De Rosa, Vincenzo Di Fiore, Giuseppe Cianflone, Rocco Dominici, Michele Iavarone, Fabrizio Lirer, Nicola Pelosi, Laura Giordano, Giovanni Ludeno, Antonio Natale, Ennio Marsella:
  Application of X-Band Wave Radar for Coastal Dynamic Analysis: Case Test of Bagnara Calabra (South Tyrrhenian Sea, Italy). J. Sensors 2016: 6236925:1-6236925:9 (2016)
• 
  Giuseppe Lancia:
  Algorithmic approaches for the single individual haplotyping problem. RAIRO Oper. Res. 50(2): 331-340 (2016)
• 
  Giuseppe Lancia, Paolo Serafini:
  The Complexity of Some Pattern Problems in the Logical Analysis of Large Genomic Data Sets. IWBBIO 2016: 3-12
• 
  Giuseppe Lancia:
  Perfect Phylogeny Haplotyping. Encyclopedia of Algorithms 2016: 1553-1557
• 
  Giuseppe Lancia, Luke Mathieson, Pablo Moscato:
  Finding Patterns is Almost Always Hard. CoRR abs/1604.03243 (2016)
• 2015
• 
  Marcello Dalpasso, Giuseppe Lancia:
  Estimating the strength of poker hands by integer linear programming techniques. Central Eur. J. Oper. Res. 23(3): 625-640 (2015)
• 
  Giuseppe Lancia, Franca Rinaldi, Paolo Serafini:
  Local search inequalities. Discret. Optim. 16: 76-89 (2015)
• 
  Giuseppe Lancia, Franca Rinaldi, Paolo Serafini:
  A Unified Integer Programming Model for Genome Rearrangement Problems. IWBBIO (1) 2015: 491-502
• 2014
• 
  Giuseppe Lancia, Paolo Serafini:
  Deriving compact extended formulations via LP-based separation techniques. 4OR 12(3): 201-234 (2014)
• 
  Robert D. Carr, Giuseppe Lancia:
  Ramsey theory and integrality gap for the independent set problem. Oper. Res. Lett. 42(2): 137-139 (2014)
• 2011
• 
  Giuseppe Lancia, Franca Rinaldi, Paolo Serafini:
  A time-indexed LP-based approach for min-sum job-shop problems. Ann. Oper. Res. 186(1): 175-198 (2011)
• 
  Giuseppe Lancia, Paolo Serafini:
  An effective compact formulation of the max cut problem on sparse graphs. Electron. Notes Discret. Math. 37: 111-116 (2011)
• 2010
• 
  Leonardo Tininini, Paola Bertolazzi, Alessandra Godi, Giuseppe Lancia:
  CollHaps: A Heuristic Approach to Haplotype Inference by Parsimony. IEEE ACM Trans. Comput. Biol. Bioinform. 7(3): 511-523 (2010)
• 
  Giuseppe Lancia, Romeo Rizzi, Russell Schwartz:
  Tiling Binary Matrices in Haplotyping: Complexity, Models and Algorithms. Stringology 2010: 89-102
• 2009
• 
  Giuseppe Lancia, Paolo Serafini:
  A Set-Covering Approach with Column Generation for Parsimony Haplotyping. INFORMS J. Comput. 21(1): 151-166 (2009)
• 2008
• 
  Giuseppe Lancia:
  Mathematical Programming in Computational Biology: an Annotated Bibliography. Algorithms 1(2): 100-129 (2008)
• 
  Paola Bertolazzi, Giovanni Felici, Paola Festa, Giuseppe Lancia:
  Logic classification and feature selection for biomedical data. Comput. Math. Appl. 55(5): 889-899 (2008)

skipping 37 more matches