| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
A branch-and-price-and-check model for the vehicle routing problem with location congestion
|
Lam, Edward
|
|
2016
|
|
3 |
p. 394-412
|
article
|
| 2 |
A collection of Constraint Programming models for the three-dimensional stable matching problem with cyclic preferences
|
Cseh, Ágnes
|
|
|
|
3 |
p. 249-283
|
article
|
| 3 |
A column-generation approach for joint mobilization and evacuation planning
|
Pillac, Victor
|
|
2015
|
|
3 |
p. 285-303
|
article
|
| 4 |
A Comparative Study of Eight Constraint Programming LanguagesOver the Boolean and Finite Domains
|
Antonio J. Fernández
|
|
2000
|
|
3 |
p. 275-301
27 p.
|
article
|
| 5 |
A Comparative Study of Eight Constraint Programming Languages Over the Boolean and Finite Domains
|
Fernández, Antonio J.
|
|
2000
|
|
3 |
p. 275-301
|
article
|
| 6 |
A constraint-based local search backend for MiniZinc
|
Björdal, Gustav
|
|
2015
|
|
3 |
p. 325-345
|
article
|
| 7 |
A Decompositional Approach for Computing Least Fixed-Pointsof Datalog Programs with Z-Counters
|
Laurent Fribourg
|
|
1997
|
|
3 |
p. 305-335
31 p.
|
article
|
| 8 |
A Formal Approach to Agent Design: An Overview of Constraint-Based Agents
|
Alan K. Mackworth
|
|
2003
|
|
3 |
p. 229-242
14 p.
|
article
|
| 9 |
A Formal Approach to Agent Design: An Overview of Constraint-Based Agents
|
Mackworth, Alan K.
|
|
2003
|
|
3 |
p. 229-242
|
article
|
| 10 |
A global constraint for over-approximation of real-time streams
|
Bart, Anicet
|
|
2017
|
|
3 |
p. 463-490
|
article
|
| 11 |
A hybrid exact method for a scheduling problem with a continuous resource and energy constraints
|
Nattaf, Margaux
|
|
2015
|
|
3 |
p. 304-324
|
article
|
| 12 |
An overview of parallel SAT solving
|
Martins, Ruben
|
|
2012
|
|
3 |
p. 304-347
|
article
|
| 13 |
A quadratic edge-finding filtering algorithm for cumulative resource constraints
|
Kameugne, Roger
|
|
2013
|
|
3 |
p. 243-269
|
article
|
| 14 |
Balancing and scheduling of flexible mixed model assembly lines
|
Öztürk, Cemalettin
|
|
2013
|
|
3 |
p. 434-469
|
article
|
| 15 |
Boosting isomorphic model filtering with invariants
|
Araújo, João
|
|
|
|
3 |
p. 360-379
|
article
|
| 16 |
Boosting Search with Variable Elimination in Constraint Optimization and Constraint Satisfaction Problems
|
Javier Larrosa
|
|
2003
|
|
3 |
p. 303-326
24 p.
|
article
|
| 17 |
Boosting Search with Variable Elimination in Constraint Optimization and Constraint Satisfaction Problems
|
Larrosa, Javier
|
|
2003
|
|
3 |
p. 303-326
|
article
|
| 18 |
Breaking symmetries in graph search with canonizing sets
|
Itzhakov, Avraham
|
|
2016
|
|
3 |
p. 357-374
|
article
|
| 19 |
Classes of submodular constraints expressible by graph cuts
|
Živný, Stanislav
|
|
2009
|
|
3 |
p. 430-452
|
article
|
| 20 |
Complete Bound Consistency for the Global Cardinality Constraint
|
Katriel, Irit
|
|
2005
|
|
3 |
p. 191-217
|
article
|
| 21 |
Complexity of minimum-size arc-inconsistency explanations
|
Bessiere, Christian
|
|
|
|
3 |
p. 427-449
|
article
|
| 22 |
Computing the Ramsey number R(4,3,3) using abstraction and symmetry breaking
|
Codish, Michael
|
|
2016
|
|
3 |
p. 375-393
|
article
|
| 23 |
Consistency techniques for polytime linear global cost functions in weighted constraint satisfaction
|
Lee, J. H. M.
|
|
2014
|
|
3 |
p. 270-308
|
article
|
| 24 |
Consistency Techniques in Ordinary Differential Equations
|
Yves Deville
|
|
2002
|
|
3 |
p. 289-315
27 p.
|
article
|
| 25 |
Constraint-directed search for all-interval series
|
Polash, Md Masbaul Alam
|
|
2016
|
|
3 |
p. 403-431
|
article
|
| 26 |
Constraint Networks of Topological Relations and Convexity
|
Ernest Davis
|
|
1999
|
|
3 |
p. 241-280
40 p.
|
article
|
| 27 |
Constraint Networks of Topological Relations and Convexity
|
Davis, Ernest
|
|
1999
|
|
3 |
p. 241-280
|
article
|
| 28 |
Constraint programming approaches to electric vehicle and robot routing problems
|
Booth, Kyle E. C.
|
|
|
|
3 |
p. 506-507
|
article
|
| 29 |
Constraint programming approach to a bilevel scheduling problem
|
Kovács, András
|
|
2010
|
|
3 |
p. 317-340
|
article
|
| 30 |
Constraint propagation on quadratic constraints
|
Domes, Ferenc
|
|
2009
|
|
3 |
p. 404-429
|
article
|
| 31 |
Constraint satisfaction for planning and scheduling problems
|
Barták, Roman
|
|
2011
|
|
3 |
p. 223-227
|
article
|
| 32 |
Constraint Solving for Term Orderings Compatible with Abelian Semigroups, Monoids and Groups
|
Guillem Godoy
|
|
2004
|
|
3 |
p. 167-192
26 p.
|
article
|
| 33 |
Constraint Solving for Term Orderings Compatible with Abelian Semigroups, Monoids and Groups
|
Godoy, Guillem
|
|
2004
|
|
3 |
p. 167-192
|
article
|
| 34 |
Constraint Solving in Uncertain and Dynamic Environments: A Survey
|
Verfaillie, Gérard
|
|
2005
|
|
3 |
p. 253-281
|
article
|
| 35 |
Correction to: Solution sampling with random table constraints
|
Vavrille, Mathieu
|
|
|
|
3 |
p. 519
|
article
|
| 36 |
Corrigendum to “Min-domain retroactive ordering for asynchronous backtracking”
|
Mechqrane, Younes
|
|
2012
|
|
3 |
p. 348-355
|
article
|
| 37 |
Cost-Based Arc Consistency for Global Cardinality Constraints
|
Jean-Charles Régin
|
|
2002
|
|
3 |
p. 387-405
19 p.
|
article
|
| 38 |
CSP beyond tractable constraint languages
|
Dreier, Jan
|
|
|
|
3 |
p. 450-471
|
article
|
| 39 |
Data transfer planning with tree placement for collaborative environments
|
Holub, Petr
|
|
2011
|
|
3 |
p. 283-316
|
article
|
| 40 |
Deep neural networks and mixed integer linear optimization
|
Fischetti, Matteo
|
|
2018
|
|
3 |
p. 296-309
|
article
|
| 41 |
Domain consistency with forbidden values
|
Deville, Yves
|
|
2012
|
|
3 |
p. 377-403
|
article
|
| 42 |
Domain reduction techniques for global NLP and MINLP optimization
|
Puranik, Yash
|
|
2017
|
|
3 |
p. 338-376
|
article
|
| 43 |
Domain Specific High-Level Constraints for User Interface Layout
|
Lutteroth, Christof
|
|
2008
|
|
3 |
p. 307-342
|
article
|
| 44 |
Dulmage-Mendelsohn Canonical Decomposition as a generic pruning technique
|
Cymer, Radosław
|
|
2012
|
|
3 |
p. 234-272
|
article
|
| 45 |
Earth Observation Satellite Management
|
E. Bensana
|
|
1999
|
|
3 |
p. 293-299
7 p.
|
article
|
| 46 |
Earth Observation Satellite Management
|
Bensana, E.
|
|
1999
|
|
3 |
p. 293-299
|
article
|
| 47 |
Editor’s note
|
Pesant, Gilles
|
|
2010
|
|
3 |
p. 305-306
|
article
|
| 48 |
Essence: A constraint language for specifying combinatorial problems
|
Frisch, Alan M.
|
|
2008
|
|
3 |
p. 268-306
|
article
|
| 49 |
EvIA - Evidential Interval Algebra and Heuristic Backtrack-Free Algorithm
|
S. Durga Bhavani
|
|
2004
|
|
3 |
p. 193-218
26 p.
|
article
|
| 50 |
EvIA - Evidential Interval Algebra and Heuristic Backtrack-Free Algorithm
|
Bhavani, S. Durga
|
|
2004
|
|
3 |
p. 193-218
|
article
|
| 51 |
Excluding Symmetries in Constraint-Based Search
|
Rolf Backofen
|
|
2002
|
|
3 |
p. 333-349
17 p.
|
article
|
| 52 |
Explaining the cumulative propagator
|
Schutt, Andreas
|
|
2010
|
|
3 |
p. 250-282
|
article
|
| 53 |
Expressiveness of Full First-Order Constraints in the Algebra of Finite or Infinite Trees
|
Alain Colmerauer
|
|
2003
|
|
3 |
p. 283-302
20 p.
|
article
|
| 54 |
Expressiveness of Full First-Order Constraints in the Algebra of Finite or Infinite Trees
|
Colmerauer, Alain
|
|
2003
|
|
3 |
p. 283-302
|
article
|
| 55 |
Expressive power and abstraction in Essence
|
Mitchell, David G.
|
|
2008
|
|
3 |
p. 343-384
|
article
|
| 56 |
Fast and parallel decomposition of constraint satisfaction problems
|
Gottlob, Georg
|
|
|
|
3 |
p. 284-326
|
article
|
| 57 |
Floating-point numbers round-off error analysis by constraint programming
|
Garcia, Rémy
|
|
|
|
3 |
p. 515
|
article
|
| 58 |
From declarative models to local search
|
Björdal, Gustav
|
|
|
|
3 |
p. 508-509
|
article
|
| 59 |
Generative magic and designing magic performances with constraint programming
|
de Azevedo Silveira, Guilherme
|
|
|
|
3 |
p. 168-191
|
article
|
| 60 |
Generic Incremental Algorithms for Local Search
|
Ågren, Magnus
|
|
2007
|
|
3 |
p. 293-324
|
article
|
| 61 |
Guest Editorial
|
Joxan Jaffar
|
|
2002
|
|
3 |
p. 227-228
2 p.
|
article
|
| 62 |
Guest Editorial
|
Rina Dechter
|
|
2003
|
|
3 |
p. 227-228
2 p.
|
article
|
| 63 |
Guest Editorial
|
Dechter, Rina
|
|
2003
|
|
3 |
p. 227-228
|
article
|
| 64 |
High-Order Consistency in Valued Constraint Satisfaction
|
Cooper, Martin C.
|
|
2005
|
|
3 |
p. 283-305
|
article
|
| 65 |
How constraint programming can help chemists to generate Benzenoid structures and assess the local Aromaticity of Benzenoids
|
Carissan, Yannick
|
|
|
|
3 |
p. 192-248
|
article
|
| 66 |
Hybrid search for minimal perturbation in Dynamic CSPs
|
Zivan, Roie
|
|
2011
|
|
3 |
p. 228-249
|
article
|
| 67 |
Implementation and Evaluation of Decision Trees with Rangeand Region Splitting
|
Yasuhiko Morimoto
|
|
1997
|
|
3 |
p. 401-427
27 p.
|
article
|
| 68 |
Improved filtering for the bin-packing with cardinality constraint
|
Derval, Guillaume
|
|
2017
|
|
3 |
p. 251-271
|
article
|
| 69 |
Improved filtering for weighted circuit constraints
|
Benchimol, Pascal
|
|
2012
|
|
3 |
p. 205-233
|
article
|
| 70 |
Introduction to the CPAIOR 2018 fast track issue
|
Hoeve, Willem-Jan van
|
|
2018
|
|
3 |
p. 294-295
|
article
|
| 71 |
Introduction to the fast track issue for CPAIOR 2016
|
Quimper, Claude-Guy
|
|
2016
|
|
3 |
p. 355-356
|
article
|
| 72 |
Introduction to the fast track issue for CPAIOR 2015
|
Michel, L.
|
|
2015
|
|
3 |
p. 283-284
|
article
|
| 73 |
Introduction to the Special Issue on Abstraction and Automation in Constraint Modelling
|
Frisch, Alan M.
|
|
2008
|
|
3 |
p. 227-228
|
article
|
| 74 |
Introduction to the Special Issue on Constraints and Databases
|
Raghu Ramakrishnan
|
|
1997
|
|
3 |
p. 243-243
1 p.
|
article
|
| 75 |
Introduction to the Special Issue on Local Search Techniques in Constraint Satisfaction
|
Naveh, Yehuda
|
|
2007
|
|
3 |
p. 261-262
|
article
|
| 76 |
Introduction to the special issue on the thirteenth international conference on principles and practice of constraint programming (CP 2007)
|
Bessiere, Christian
|
|
2008
|
|
3 |
p. 293
|
article
|
| 77 |
Intruder alert! Optimization models for solving the mobile robot graph-clear problem
|
Morin, Michael
|
|
2018
|
|
3 |
p. 335-354
|
article
|
| 78 |
Lagrangian bounds from decision diagrams
|
Bergman, David
|
|
2015
|
|
3 |
p. 346-361
|
article
|
| 79 |
Learn and route: learning implicit preferences for vehicle routing
|
Canoy, Rocsildes
|
|
|
|
3 |
p. 363-396
|
article
|
| 80 |
Learning to select SAT encodings for pseudo-Boolean and linear integer constraints
|
Ulrich-Oltean, Felix
|
|
|
|
3 |
p. 397-426
|
article
|
| 81 |
Lightweight dynamic symmetry breaking
|
Mears, Christopher
|
|
2013
|
|
3 |
p. 195-242
|
article
|
| 82 |
Limitations of restricted branching in clause learning
|
Järvisalo, Matti
|
|
2009
|
|
3 |
p. 325-356
|
article
|
| 83 |
Linear-time filtering algorithms for the disjunctive constraint and a quadratic filtering algorithm for the cumulative not-first not-last
|
Fahimi, Hamed
|
|
2018
|
|
3 |
p. 272-293
|
article
|
| 84 |
Local Search-based Hybrid Algorithms for Finding Golomb Rulers
|
Cotta, Carlos
|
|
2007
|
|
3 |
p. 263-291
|
article
|
| 85 |
Local-search Extraction of MUSes
|
Grégoire, Éric
|
|
2007
|
|
3 |
p. 325-344
|
article
|
| 86 |
Maintaining Global Integrity Constraints in DistributedDatabases
|
Nam Huyn
|
|
1997
|
|
3 |
p. 377-399
23 p.
|
article
|
| 87 |
Memoing Evaluation for Constraint Extensions of Datalog
|
David Toman
|
|
1997
|
|
3 |
p. 337-359
23 p.
|
article
|
| 88 |
Model-driven visualizations of constraint-based local search
|
Dooms, Grégoire
|
|
2009
|
|
3 |
p. 294-324
|
article
|
| 89 |
Multi-language evaluation of exact solvers in graphical model discrete optimization
|
Hurley, Barry
|
|
2016
|
|
3 |
p. 413-434
|
article
|
| 90 |
Multiset variable representations and constraint propagation
|
Law, Y. C.
|
|
2013
|
|
3 |
p. 307-343
|
article
|
| 91 |
New filtering for AtMostNValue and its weighted variant: A Lagrangian approach
|
Cambazard, Hadrien
|
|
2015
|
|
3 |
p. 362-380
|
article
|
| 92 |
New Tractable Classes From Old
|
David Cohen
|
|
2003
|
|
3 |
p. 263-282
20 p.
|
article
|
| 93 |
New Tractable Classes From Old
|
Cohen, David
|
|
2003
|
|
3 |
p. 263-282
|
article
|
| 94 |
Nogood-based asynchronous forward checking algorithms
|
Wahbi, Mohamed
|
|
2013
|
|
3 |
p. 404-433
|
article
|
| 95 |
Online over time processing of combinatorial problems
|
Duque, Robinson
|
|
2018
|
|
3 |
p. 310-334
|
article
|
| 96 |
On Parallel Partial Solutions and Approximation Schemesfor Local Consistency in Networks of Constraints
|
N. D. Dendris
|
|
2000
|
|
3 |
p. 251-273
23 p.
|
article
|
| 97 |
On Parallel Partial Solutions and Approximation Schemes for Local Consistency in Networks of Constraints
|
Dendris, N. D.
|
|
2000
|
|
3 |
p. 251-273
|
article
|
| 98 |
Optimal Distributed Arc-Consistency
|
Youssef Hamadi
|
|
2002
|
|
3 |
p. 367-385
19 p.
|
article
|
| 99 |
Optimization methods based on decision diagrams for constraint programming, AI planning, and mathematical programming
|
Castro, Margarita Paz
|
|
|
|
3 |
p. 511-512
|
article
|
| 100 |
Optimization-Oriented Global Constraints
|
Filippo Focacci
|
|
2002
|
|
3 |
p. 351-365
15 p.
|
article
|
| 101 |
Partition-Based Lower Bound for Max-CSP
|
Javier Larrosa
|
|
2002
|
|
3 |
p. 407-419
13 p.
|
article
|
| 102 |
Philosophy of the MiniZinc challenge
|
Stuckey, Peter J.
|
|
2010
|
|
3 |
p. 307-316
|
article
|
| 103 |
Probabilistic constraints for nonlinear inverse problems
|
Carvalho, Elsa
|
|
2013
|
|
3 |
p. 344-376
|
article
|
| 104 |
Promoting robust black-box solvers through competitions
|
Lecoutre, Christophe
|
|
2010
|
|
3 |
p. 317-326
|
article
|
| 105 |
Propagation complete encodings of smooth DNNF theories
|
Kučera, Petr
|
|
|
|
3 |
p. 327-359
|
article
|
| 106 |
Propagation via lazy clause generation
|
Ohrimenko, Olga
|
|
2009
|
|
3 |
p. 357-391
|
article
|
| 107 |
PSICO: Solving Protein Structures with Constraint Programming and Optimization
|
Ludwig Krippahl
|
|
2002
|
|
3 |
p. 317-331
15 p.
|
article
|
| 108 |
QOCA: A Constraint Solving Toolkit for Interactive Graphical Applications
|
Kim Marriott
|
|
2002
|
|
3 |
p. 229-254
26 p.
|
article
|
| 109 |
Random 3-SAT: The Plot Thickens
|
Cristian Coarfa
|
|
2003
|
|
3 |
p. 243-261
19 p.
|
article
|
| 110 |
Random 3-SAT: The Plot Thickens
|
Coarfa, Cristian
|
|
2003
|
|
3 |
p. 243-261
|
article
|
| 111 |
Reasoning and inference for (Maximum) satisfiability: new insights
|
Cherif, Mohamed Sami
|
|
|
|
3 |
p. 513-514
|
article
|
| 112 |
Redundant modeling in permutation weighted constraint satisfaction problems
|
Law, Yat Chiu
|
|
2009
|
|
3 |
p. 354-403
|
article
|
| 113 |
Refined Inequalities for Stable Marriage
|
Brian Aldershof
|
|
1999
|
|
3 |
p. 281-292
12 p.
|
article
|
| 114 |
Refined Inequalities for Stable Marriage
|
Aldershof, Brian
|
|
1999
|
|
3 |
p. 281-292
|
article
|
| 115 |
Refining Restriction Enzyme Genome Maps
|
Peter Z. Revesz
|
|
1997
|
|
3 |
p. 361-375
15 p.
|
article
|
| 116 |
Reformulating Table Constraints using Functional Dependencies—An Application to Explanation Generation
|
Cambazard, Hadrien
|
|
2008
|
|
3 |
p. 385-406
|
article
|
| 117 |
Representation and Reasoning with Multi-Point Events
|
Rattana Wetprasit
|
|
2000
|
|
3 |
p. 211-249
39 p.
|
article
|
| 118 |
Representation and Reasoning with Multi-Point Events
|
Wetprasit, Rattana
|
|
2000
|
|
3 |
p. 211-249
|
article
|
| 119 |
Revisiting restricted path consistency
|
Stergiou, Kostas
|
|
2016
|
|
3 |
p. 377-402
|
article
|
| 120 |
Rewriting Union Queries Using Views
|
Wang, J.
|
|
2005
|
|
3 |
p. 219-251
|
article
|
| 121 |
SALSA: A Language for Search Algorithms
|
François Laburthe
|
|
2002
|
|
3 |
p. 255-288
34 p.
|
article
|
| 122 |
Satisfiability Testing of Boolean Combinations of Pseudo-Boolean Constraints using Local-search Techniques
|
Liu, Lengning
|
|
2007
|
|
3 |
p. 345-369
|
article
|
| 123 |
Scheduling through logic-based tools
|
Coll Caballero, Jordi
|
|
|
|
3 |
p. 510
|
article
|
| 124 |
Security-Aware Database Migration Planning
|
Acikalin, Utku Umur
|
|
|
|
3 |
p. 472-505
|
article
|
| 125 |
Semiring-Based CSPs and Valued CSPs: Frameworks, Properties,and Comparison
|
S. Bistarelli
|
|
1999
|
|
3 |
p. 199-240
42 p.
|
article
|
| 126 |
Semiring-Based CSPs and Valued CSPs: Frameworks, Properties, and Comparison
|
Bistarelli, S.
|
|
1999
|
|
3 |
p. 199-240
|
article
|
| 127 |
Solution counting algorithms for constraint-centered search heuristics
|
Zanarini, Alessandro
|
|
2008
|
|
3 |
p. 392-413
|
article
|
| 128 |
Solving constraint satisfaction problems with SAT modulo theories
|
Bofill, Miquel
|
|
2012
|
|
3 |
p. 273-303
|
article
|
| 129 |
Solving subgraph isomorphism problems with constraint programming
|
Zampelli, Stéphane
|
|
2009
|
|
3 |
p. 327-353
|
article
|
| 130 |
Spacetime programming: a synchronous language for constraint search
|
Talbot, Pierre
|
|
|
|
3 |
p. 516-517
|
article
|
| 131 |
Stochastic Local Search Algorithms for Graph Set T-colouring and Frequency Assignment
|
Chiarandini, Marco
|
|
2007
|
|
3 |
p. 371-403
|
article
|
| 132 |
Temporal Causal Abduction
|
Maroua Bouzid
|
|
2000
|
|
3 |
p. 303-319
17 p.
|
article
|
| 133 |
Temporal Causal Abduction
|
Bouzid, Maroua
|
|
2000
|
|
3 |
p. 303-319
|
article
|
| 134 |
The CCUBE Constraint Object-Oriented Database System
|
Alexander Brodsky
|
|
1997
|
|
3 |
p. 245-277
33 p.
|
article
|
| 135 |
The Design of the Zinc Modelling Language
|
Marriott, Kim
|
|
2008
|
|
3 |
p. 229-267
|
article
|
| 136 |
The extensional constraint
|
Verhaeghe, Hélène
|
|
|
|
3 |
p. 518
|
article
|
| 137 |
The octagon abstract domain for continuous constraints
|
Pelleau, Marie
|
|
2014
|
|
3 |
p. 309-337
|
article
|
| 138 |
Toward Practical Query Evaluation for Constraint Databases
|
Alexander Brodsky
|
|
1997
|
|
3 |
p. 279-304
26 p.
|
article
|
| 139 |
Tractable Decision for a Constraint Language Implies Tractable Search
|
D. A. Cohen
|
|
2004
|
|
3 |
p. 219-229
11 p.
|
article
|
| 140 |
Tractable Decision for a Constraint Language Implies Tractable Search
|
Cohen, D. A.
|
|
2004
|
|
3 |
p. 219-229
|
article
|
| 141 |
Using constraint programming for solving RCPSP/max-cal
|
Kreter, Stefan
|
|
2017
|
|
3 |
p. 432-462
|
article
|
| 142 |
What is answer set programming to propositional satisfiability
|
Lierler, Yuliya
|
|
2016
|
|
3 |
p. 307-337
|
article
|
| 143 |
When bounds consistency implies domain consistency for regular counting constraints
|
Martin, Barnaby
|
|
|
|
3 |
p. 161-167
|
article
|
Journal description