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

• 2023
• 
  Edward Lam:
  Hybrid optimization of vehicle routing problems. Constraints An Int. J. 28(2): 67-68 (2023)
• 
  Utku Umur Acikalin, Bugra Çaskurlu, K. Subramani:
  Security-Aware Database Migration Planning. Constraints An Int. J. 28(3): 472-505 (2023)
• 
  Christian Bessiere, Clément Carbonnel, Martin C. Cooper, Emmanuel Hebrard:
  Complexity of minimum-size arc-inconsistency explanations. Constraints An Int. J. 28(3): 427-449 (2023)
• 
  Gustav Björdal:
  From declarative models to local search. Constraints An Int. J. 28(3): 508-509 (2023)
• 
  Manuel Bodirsky, Jakub Bulín, Florian Starke, Michael Wernthaler:
  The smallest hard trees. Constraints An Int. J. 28(2): 105-137 (2023)
• 
  Kyle E. C. Booth:
  Constraint programming approaches to electric vehicle and robot routing problems. Constraints An Int. J. 28(3): 506-507 (2023)
• 
  Justin J. Boutilier, Carla Michini, Zachary Zhou:
  Optimal multivariate decision trees. Constraints An Int. J. 28(4): 549-577 (2023)
• 
  Jordi Coll Caballero:
  Scheduling through logic-based tools. Constraints An Int. J. 28(3): 510 (2023)
• 
  Rocsildes Canoy, Víctor Bucarey, Jayanta Mandi, Tias Guns:
  Learn and route: learning implicit preferences for vehicle routing. Constraints An Int. J. 28(3): 363-396 (2023)
• 
  Margarita P. Castro:
  Optimization methods based on decision diagrams for constraint programming, AI planning, and mathematical programming. Constraints An Int. J. 28(3): 511-512 (2023)
• 
  Mohamed Sami Cherif:
  Reasoning and inference for (Maximum) satisfiability: new insights. Constraints An Int. J. 28(3): 513-514 (2023)
• 
  Ágnes Cseh, Guillaume Escamocher, Luis Quesada:
  Computing relaxations for the three-dimensional stable matching problem with cyclic preferences. Constraints An Int. J. 28(2): 138-165 (2023)
• 
  Tomás Dlask:
  Block-coordinate descent and local consistencies in linear programming. Constraints An Int. J. 28(2): 69-70 (2023)
• 
  Tomás Dlask, Tomás Werner:
  Activity propagation in systems of linear inequalities and its relation to block-coordinate descent in linear programs. Constraints An Int. J. 28(2): 244-276 (2023)
• 
  Tomás Dlask, Tomás Werner, Simon de Givry:
  Super-reparametrizations of weighted CSPs: properties and optimization perspective. Constraints An Int. J. 28(2): 277-319 (2023)
• 
  Jan Dreier, Sebastian Ordyniak, Stefan Szeider:
  CSP beyond tractable constraint languages. Constraints An Int. J. 28(3): 450-471 (2023)
• 
  Rémy Garcia:
  Floating-point numbers round-off error analysis by constraint programming. Constraints An Int. J. 28(3): 515 (2023)
• 
  Anissa Kheireddine, Etienne Renault, Souheib Baarir:
  Towards better heuristics for solving bounded model checking problems. Constraints An Int. J. 28(1): 45-66 (2023)
• 
  Marie-Louise Lackner, Christoph Mrkvicka, Nysret Musliu, Daniel Walkiewicz, Felix Winter:
  Exact methods for the Oven Scheduling Problem. Constraints An Int. J. 28(2): 320-361 (2023)
• 
  Ilankaikone Senthooran, Matthias Klapperstück, Gleb Belov, Tobias Czauderna, Kevin Leo, Mark Wallace, Michael Wybrow, Maria Garcia de la Banda:
  Human-centred feasibility restoration in practice. Constraints An Int. J. 28(2): 203-243 (2023)
• 
  Pouya Shati, Eldan Cohen, Sheila A. McIlraith:
  SAT-based optimal classification trees for non-binary data. Constraints An Int. J. 28(2): 166-202 (2023)
• 
  Rustem Takhanov:
  The algebraic structure of the densification and the sparsification tasks for CSPs. Constraints An Int. J. 28(1): 13-44 (2023)
• 
  Pierre Talbot:
  Spacetime programming: a synchronous language for constraint search. Constraints An Int. J. 28(3): 516-517 (2023)
• 
  Felix Ulrich-Oltean, Peter Nightingale, James Alfred Walker:
  Learning to select SAT encodings for pseudo-Boolean and linear integer constraints. Constraints An Int. J. 28(3): 397-426 (2023)
• 
  Mathieu Vavrille:
  A feature commonality-based search strategy to find high t-wise covering solutions in feature models. Constraints An Int. J. 28(4): 521-548 (2023)
• 
  Mathieu Vavrille, Charlotte Truchet, Charles Prud'homme:
  Correction to: Solution sampling with random table constraints. Constraints An Int. J. 28(3): 519 (2023)
• 
  Hélène Verhaeghe:
  The extensional constraint. Constraints An Int. J. 28(3): 518 (2023)
• 
  Johan Wessén, Mats Carlsson, Christian Schulte, Pierre Flener, Federico Pecora, Mihhail Matskin:
  A constraint programming model for the scheduling and workspace layout design of a dual-arm multi-tool assembly robot. Constraints An Int. J. 28(2): 71-104 (2023)
• 
  Matteo Zavatteri, Alice Raffaele, Dario Ostuni, Romeo Rizzi:
  An interdisciplinary experimental evaluation on the disjunctive temporal problem. Constraints An Int. J. 28(1): 1-12 (2023)