| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas
|
Liffiton, Mark
|
|
2008
|
|
4 |
p. 415-442
|
article
|
| 2 |
A Comparison of Traditional and Constraint-based HeuristicMethods on Vehicle Routing Problems with Side Constraints
|
Philip Kilby
|
|
2000
|
|
4 |
p. 389-414
26 p.
|
article
|
| 3 |
A Comparison of Traditional and Constraint-based Heuristic Methods on Vehicle Routing Problems with Side Constraints
|
Kilby, Philip
|
|
2000
|
|
4 |
p. 389-414
|
article
|
| 4 |
A complexity perspective on entailment of parameterized linear constraints
|
Eirinakis, Pavlos
|
|
2012
|
|
4 |
p. 461-487
|
article
|
| 5 |
A Constraint-based Approach for Annotating Music Scores with Gestural Information
|
Radicioni, Daniele P.
|
|
2007
|
|
4 |
p. 405-428
|
article
|
| 6 |
A constraint programming approach to the additional relay placement problem in wireless sensor networks
|
Quesada, Luis
|
|
2015
|
|
4 |
p. 433-451
|
article
|
| 7 |
A Context for Constraint Satisfaction Problem Formulation Selection
|
James E. Borrett
|
|
2001
|
|
4 |
p. 299-327
29 p.
|
article
|
| 8 |
A Cost-Regular Based Hybrid Column Generation Approach
|
Demassey, Sophie
|
|
2006
|
|
4 |
p. 315-333
|
article
|
| 9 |
Acquiring Both Constraint and Solution Preferences in Interactive Constraint Systems
|
Francesca Rossi
|
|
2004
|
|
4 |
p. 311-332
22 p.
|
article
|
| 10 |
Acquiring Both Constraint and Solution Preferences in Interactive Constraint Systems
|
Rossi, Francesca
|
|
2004
|
|
4 |
p. 311-332
|
article
|
| 11 |
Adaptive constructive interval disjunction: algorithms and experiments
|
Neveu, Bertrand
|
|
2015
|
|
4 |
p. 452-467
|
article
|
| 12 |
A feature commonality-based search strategy to find high t-wise covering solutions in feature models
|
Vavrille, Mathieu
|
|
|
|
4 |
p. 521-548
|
article
|
| 13 |
A Global Chance-Constraint for Stochastic Inventory Systems Under Service Level Constraints
|
Rossi, Roberto
|
|
|
|
4 |
p. 490-517
|
article
|
| 14 |
A Global Chance-Constraint for Stochastic Inventory Systems Under Service Level Constraints
|
Rossi, Roberto
|
|
2008
|
|
4 |
p. 490-517
|
article
|
| 15 |
A Hybrid Method for the Planning and Scheduling
|
Hooker, J. N.
|
|
2005
|
|
4 |
p. 385-401
|
article
|
| 16 |
A hybrid tractable class for non-binary CSPs
|
El Mouelhi, Achref
|
|
2015
|
|
4 |
p. 383-413
|
article
|
| 17 |
A lagrangian propagator for artificial neural networks in constraint programming
|
Lombardi, Michele
|
|
2015
|
|
4 |
p. 435-462
|
article
|
| 18 |
Algorithmic Power from Declarative Use of Redundant Constraints
|
M. H. van Emden
|
|
1999
|
|
4 |
p. 363-381
19 p.
|
article
|
| 19 |
Algorithmic Power from Declarative Use of Redundant Constraints
|
van Emden, M. H.
|
|
1999
|
|
4 |
p. 363-381
|
article
|
| 20 |
A Methodological View of Constraint Solving
|
Hubert Comon
|
|
1999
|
|
4 |
p. 337-361
25 p.
|
article
|
| 21 |
A Methodological View of Constraint Solving
|
Comon, Hubert
|
|
1999
|
|
4 |
p. 337-361
|
article
|
| 22 |
An algorithm-independent measure of progress for linear constraint propagation
|
Sofranac, Boro
|
|
|
|
4 |
p. 432-455
|
article
|
| 23 |
An Analysis of Arithmetic Constraints on Integer Intervals
|
Apt, Krzysztof R.
|
|
2007
|
|
4 |
p. 429-468
|
article
|
| 24 |
An Application of CLP: Checking the Correctness of Theoremsin Geometry
|
Denis Bouhineau
|
|
1999
|
|
4 |
p. 383-405
23 p.
|
article
|
| 25 |
An Application of CLP: Checking the Correctness of Theorems in Geometry
|
Bouhineau, Denis
|
|
1999
|
|
4 |
p. 383-405
|
article
|
| 26 |
An Inventory Management Problem
|
YVES CASEAU
|
|
1998
|
|
4 |
p. 363-373
11 p.
|
article
|
| 27 |
An Inventory Management Problem
|
Caseau, Yves
|
|
1998
|
|
4 |
p. 363-373
|
article
|
| 28 |
A parametric filtering algorithm for the graph isomorphism problem
|
Sorlin, Sébastien
|
|
|
|
4 |
p. 518-537
|
article
|
| 29 |
A parametric filtering algorithm for the graph isomorphism problem
|
Sorlin, Sébastien
|
|
2008
|
|
4 |
p. 518-537
|
article
|
| 30 |
A Repeated-Update Problem in the DeltaBlue Algorithm
|
Tetsuya Suzuki
|
|
1998
|
|
4 |
p. 331-341
11 p.
|
article
|
| 31 |
A Repeated-Update Problem in the DeltaBlue Algorithm
|
Suzuki, Tetsuya
|
|
1998
|
|
4 |
p. 331-341
|
article
|
| 32 |
Automatic Generation of Redundant Models for Permutation Constraint Satisfaction Problems
|
Law, Yat Chiu
|
|
2007
|
|
4 |
p. 469-505
|
article
|
| 33 |
Auto-tabling for subproblem presolving in MiniZinc
|
Dekker, Jip J.
|
|
2017
|
|
4 |
p. 512-529
|
article
|
| 34 |
ℚ-bounds consistency for the spread constraint with variable mean
|
Loong, Soon Chee
|
|
2016
|
|
4 |
p. 646-652
|
article
|
| 35 |
CLPGUI: A Generic Graphical User Interface for Constraint Logic Programming
|
François Fages
|
|
2004
|
|
4 |
p. 241-262
22 p.
|
article
|
| 36 |
CLPGUI: A Generic Graphical User Interface for Constraint Logic Programming
|
Fages, François
|
|
2004
|
|
4 |
p. 241-262
|
article
|
| 37 |
Combining Tree Partitioning, Precedence, and Incomparability Constraints
|
Beldiceanu, Nicolas
|
|
|
|
4 |
p. 459-489
|
article
|
| 38 |
Combining Tree Partitioning, Precedence, and Incomparability Constraints
|
Beldiceanu, Nicolas
|
|
2008
|
|
4 |
p. 459-489
|
article
|
| 39 |
Compiling CSPs into Tree-Driven Automata for Interactive Solving
|
Hélène Fargier
|
|
2004
|
|
4 |
p. 263-287
25 p.
|
article
|
| 40 |
Compiling CSPs into Tree-Driven Automata for Interactive Solving
|
Fargier, Hélène
|
|
2004
|
|
4 |
p. 263-287
|
article
|
| 41 |
Constrained global optimization for wine blending
|
Vismara, Philippe
|
|
2015
|
|
4 |
p. 597-615
|
article
|
| 42 |
Constrained Graph Layout
|
Weiqing He
|
|
1998
|
|
4 |
p. 289-314
26 p.
|
article
|
| 43 |
Constrained Graph Layout
|
He, Weiqing
|
|
1998
|
|
4 |
p. 289-314
|
article
|
| 44 |
Constraint-Based Attribute and Interval Planning
|
Jeremy Frank
|
|
2003
|
|
4 |
p. 339-364
26 p.
|
article
|
| 45 |
Constraint-Based Attribute and Interval Planning
|
Frank, Jeremy
|
|
2003
|
|
4 |
p. 339-364
|
article
|
| 46 |
Constraint programming for wireless sensor networks
|
Hassani Bijarbooneh, Farshid
|
|
2015
|
|
4 |
p. 508
|
article
|
| 47 |
Constraints for membership in formal languages under systematic search and stochastic local search
|
He, Jun
|
|
2015
|
|
4 |
p. 477-478
|
article
|
| 48 |
Constraints meet concurrency
|
Mauro, Jacopo
|
|
2015
|
|
4 |
p. 488-489
|
article
|
| 49 |
Contraint-Based Combinators for Local Search
|
Hentenryck, Pascal Van
|
|
2005
|
|
4 |
p. 363-384
|
article
|
| 50 |
Cost-based filtering algorithms for a Capacitated Lot Sizing Problem and the Constrained Arborescence Problem
|
Houndji, Vinasetan Ratheil
|
|
2018
|
|
4 |
p. 481-482
|
article
|
| 51 |
CTP: A New Constraint-Based Formalism for Conditional, Temporal Planning
|
Ioannis Tsamardinos
|
|
2003
|
|
4 |
p. 365-388
24 p.
|
article
|
| 52 |
CTP: A New Constraint-Based Formalism for Conditional, Temporal Planning
|
Tsamardinos, Ioannis
|
|
2003
|
|
4 |
p. 365-388
|
article
|
| 53 |
Cumulative scheduling with variable task profiles and concave piecewise linear processing rate functions
|
Nattaf, Margaux
|
|
2017
|
|
4 |
p. 530-547
|
article
|
| 54 |
Decision diagrams for optimization
|
Cire, Andre Augusto
|
|
2015
|
|
4 |
p. 494-495
|
article
|
| 55 |
Decision support for disaster management through hybrid optimization
|
Coffrin, Carleton
|
|
2015
|
|
4 |
p. 490-491
|
article
|
| 56 |
Decision Tradeoff Using Example-Critiquing and Constraint Programming
|
Pearl Pu
|
|
2004
|
|
4 |
p. 289-310
22 p.
|
article
|
| 57 |
Decision Tradeoff Using Example-Critiquing and Constraint Programming
|
Pu, Pearl
|
|
2004
|
|
4 |
p. 289-310
|
article
|
| 58 |
Declarative pattern mining using constraint programming
|
Guns, Tias
|
|
2015
|
|
4 |
p. 492-493
|
article
|
| 59 |
Dynamic structural symmetry breaking for constraint satisfaction problems
|
Flener, Pierre
|
|
2008
|
|
4 |
p. 506-538
|
article
|
| 60 |
Efficient algorithms for strong local consistencies and adaptive techniques in constraint satisfaction problems
|
Paparrizou, Anastasia
|
|
2015
|
|
4 |
p. 484-485
|
article
|
| 61 |
Efficient filtering for the Resource-Cost AllDifferent constraint
|
Cauwelaert, Sascha Van
|
|
2017
|
|
4 |
p. 493-511
|
article
|
| 62 |
Efficient search procedures for solving combinatorial problems
|
Kadioglu, Serdar
|
|
2015
|
|
4 |
p. 475-476
|
article
|
| 63 |
Enabling local computation for partially ordered preferences
|
Fargier, Hélène
|
|
2010
|
|
4 |
p. 516-539
|
article
|
| 64 |
Evaluating ASP and Commercial Solvers on the CSPLib
|
Mancini, Toni
|
|
|
|
4 |
p. 407-436
|
article
|
| 65 |
Evaluating ASP and Commercial Solvers on the CSPLib
|
Mancini, Toni
|
|
2007
|
|
4 |
p. 407-436
|
article
|
| 66 |
Explanation-based large neighborhood search
|
Prud’homme, Charles
|
|
2014
|
|
4 |
p. 339-379
|
article
|
| 67 |
Extending SMT solvers with support for finite domain alldifferent constraint
|
Banković, Milan
|
|
2015
|
|
4 |
p. 463-494
|
article
|
| 68 |
Extension of O(n log n) Filtering Algorithms for the Unary Resource Constraint to Optional Activities
|
Vilím, Petr
|
|
2005
|
|
4 |
p. 403-425
|
article
|
| 69 |
Filtering Algorithms for the NValue Constraint
|
Bessiere, Christian
|
|
2006
|
|
4 |
p. 271-293
|
article
|
| 70 |
From MDD to BDD and Arc consistency
|
Vion, Julien
|
|
2018
|
|
4 |
p. 451-480
|
article
|
| 71 |
From Prolog III to Prolog IV: The Logic of Constraint ProgrammingRevisited
|
Guy A. Narboni
|
|
1999
|
|
4 |
p. 313-335
23 p.
|
article
|
| 72 |
From Prolog III to Prolog IV: The Logic of Constraint Programming Revisited
|
Narboni, Guy A.
|
|
1999
|
|
4 |
p. 313-335
|
article
|
| 73 |
Graph coloring inequalities from all-different systems
|
Bergman, David
|
|
2014
|
|
4 |
p. 404-433
|
article
|
| 74 |
Guest Editorial
|
Jacques Cohen
|
|
1999
|
|
4 |
p. 307-311
5 p.
|
article
|
| 75 |
Guest Editorial
|
Cohen, Jacques
|
|
1999
|
|
4 |
p. 307-311
|
article
|
| 76 |
Guided Genetic Algorithm and its Application to Radio Link Frequency Assignment Problems
|
T. L. Lau
|
|
2001
|
|
4 |
p. 373-398
26 p.
|
article
|
| 77 |
Guided Genetic Algorithm and its Application to Radio Link Frequency Assignment Problems
|
Lau, T. L.
|
|
2001
|
|
4 |
p. 373-398
|
article
|
| 78 |
Hybrid meta-heuristics for combinatorial optimization
|
Urli, Tommaso
|
|
2015
|
|
4 |
p. 473
|
article
|
| 79 |
Identifying and Exploiting Problem Structures Using Explanation-based Constraint Programming
|
Cambazard, Hadrien
|
|
2006
|
|
4 |
p. 295-313
|
article
|
| 80 |
Instance-specific algorithm configuration
|
Malitsky, Yuri
|
|
2015
|
|
4 |
p. 474
|
article
|
| 81 |
Interleaving solving and elicitation of constraint satisfaction problems based on expected cost
|
Wilson, Nic
|
|
2010
|
|
4 |
p. 540-573
|
article
|
| 82 |
Interval-based projection method for under-constrained numerical systems
|
Ishii, Daisuke
|
|
2012
|
|
4 |
p. 432-460
|
article
|
| 83 |
Introduction
|
J. Christopher Beck
|
|
2000
|
|
4 |
p. 327-334
8 p.
|
article
|
| 84 |
Introduction
|
|
|
2005
|
|
4 |
p. 283-305
|
article
|
| 85 |
Introduction
|
Beck, J. Christopher
|
|
2000
|
|
4 |
p. 327-334
|
article
|
| 86 |
Introduction to the CPAIOR 2017 fast track issue
|
Salvagnin, Domenico
|
|
2017
|
|
4 |
p. 491-492
|
article
|
| 87 |
Introduction to the special issue on Constraint-based approaches to Preference Modelling and Reasoning
|
Meseguer, Pedro
|
|
2010
|
|
4 |
p. 453-455
|
article
|
| 88 |
Introduction to the special issue on CSP technologies in artificial intelligence
|
Grégoire, Éric
|
|
2015
|
|
4 |
p. 381-382
|
article
|
| 89 |
Introduction to the Special Issue on Planning: Research Issues at the Intersection of Planning and Constraint Programming
|
Alexander Nareyek
|
|
2003
|
|
4 |
p. 335-338
4 p.
|
article
|
| 90 |
Introduction to the Special Issue on Planning: Research Issues at the Intersection of Planning and Constraint Programming
|
Nareyek, Alexander
|
|
2003
|
|
4 |
p. 335-338
|
article
|
| 91 |
Introduction to the Special Issue on the Integration of AI and OR Techniques in CP for Combinatorial Optimization (CPAIOR 2005)
|
Barták, Roman
|
|
2006
|
|
4 |
p. 269-270
|
article
|
| 92 |
Introduction to the Special Issue on User-Interaction in Constraint Satisfaction
|
Barry O'Sullivan
|
|
2004
|
|
4 |
p. 239-240
2 p.
|
article
|
| 93 |
Introduction to the Special Issue on User-Interaction in Constraint Satisfaction
|
O'Sullivan, Barry
|
|
2004
|
|
4 |
p. 239-240
|
article
|
| 94 |
Iterative and core-guided MaxSAT solving: A survey and assessment
|
Morgado, Antonio
|
|
2013
|
|
4 |
p. 478-534
|
article
|
| 95 |
Keep-Best Reproduction: A Local Family Competition Selection Strategy and the Environment it Flourishes in
|
Kay C. Wiese
|
|
2001
|
|
4 |
p. 399-422
24 p.
|
article
|
| 96 |
Keep–Best Reproduction: A Local Family Competition Selection Strategy and the Environment it Flourishes in
|
Wiese, Kay C.
|
|
2001
|
|
4 |
p. 399-422
|
article
|
| 97 |
LS(Graph): a constraint-based local search for constraint optimization on trees and paths
|
Pham, Quang Dung
|
|
2012
|
|
4 |
p. 357-408
|
article
|
| 98 |
Maxx: Test Pattern Optimisation with Local Search Over an Extended Logic
|
Azevedo, Francisco
|
|
2007
|
|
4 |
p. 507-538
|
article
|
| 99 |
MDD propagators with explanation
|
Gange, Graeme
|
|
2011
|
|
4 |
p. 407-429
|
article
|
| 100 |
meSAT: multiple encodings of CSP to SAT
|
Stojadinović, Mirko
|
|
2014
|
|
4 |
p. 380-403
|
article
|
| 101 |
MiniBrass: Soft constraints for MiniZinc
|
Schiendorfer, Alexander
|
|
2018
|
|
4 |
p. 403-450
|
article
|
| 102 |
Minimization of Locally Defined Submodular Functions by Optimal Soft Arc Consistency
|
Cooper, Martin C.
|
|
|
|
4 |
p. 437-458
|
article
|
| 103 |
Minimization of Locally Defined Submodular Functions by Optimal Soft Arc Consistency
|
Cooper, Martin C.
|
|
2007
|
|
4 |
p. 437-458
|
article
|
| 104 |
Mining Time-constrained Sequential Patterns with Constraint Programming
|
Aoga, John O. R.
|
|
2017
|
|
4 |
p. 548-570
|
article
|
| 105 |
Models and emerging trends of concurrent constraint programming
|
Olarte, Carlos
|
|
2013
|
|
4 |
p. 535-578
|
article
|
| 106 |
Multiconsistency and Robustness with Global Constraints
|
Elbassioni, Khaled
|
|
2006
|
|
4 |
p. 335-352
|
article
|
| 107 |
Negation as Failure as Resolution
|
Vijay Chandru
|
|
1998
|
|
4 |
p. 315-329
15 p.
|
article
|
| 108 |
Negation as Failure as Resolution
|
Chandru, Vijay
|
|
1998
|
|
4 |
p. 315-329
|
article
|
| 109 |
New algorithms for max restricted path consistency
|
Balafoutis, Thanasis
|
|
2011
|
|
4 |
p. 372-406
|
article
|
| 110 |
New techniques for discrete optimization
|
Bergman, David
|
|
2015
|
|
4 |
p. 486-487
|
article
|
| 111 |
Non-binary quantified CSP: algorithms and modelling
|
Nightingale, Peter
|
|
2009
|
|
4 |
p. 539-581
|
article
|
| 112 |
Nondeterministic Control for Hybrid Search
|
Hentenryck, Pascal Van
|
|
2006
|
|
4 |
p. 353-373
|
article
|
| 113 |
On Algorithm Selection, with an application to combinatorial search problems
|
Kotthoff, Lars
|
|
2015
|
|
4 |
p. 481-482
|
article
|
| 114 |
On a new extension of BTP for binary CSPs
|
Mouelhi, Achref El
|
|
2018
|
|
4 |
p. 355-382
|
article
|
| 115 |
On getting rid of the preprocessing minimization step in MUC-finding algorithms
|
Grégoire, Éric
|
|
2015
|
|
4 |
p. 414-432
|
article
|
| 116 |
On implementing symmetry detection
|
Mears, C.
|
|
2008
|
|
4 |
p. 443-477
|
article
|
| 117 |
On the use of graphs within constraint-programming
|
Fages, Jean-Guillaume
|
|
2015
|
|
4 |
p. 498-499
|
article
|
| 118 |
Operating room management under uncertainty
|
Gauthier, Jean Bertrand
|
|
2015
|
|
4 |
p. 577-596
|
article
|
| 119 |
Optimal multivariate decision trees
|
Boutilier, Justin
|
|
|
|
4 |
p. 549-577
|
article
|
| 120 |
Parallel search for maximum satisfiability
|
Martins, Ruben
|
|
2015
|
|
4 |
p. 469-470
|
article
|
| 121 |
PhD theses in constraints 2012–2015
|
Tack, Guido
|
|
2015
|
|
4 |
p. 468
|
article
|
| 122 |
Planning as Propositional CSP: From Walksat to Local Search Techniques for Action Graphs
|
Alfonso Gerevini
|
|
2003
|
|
4 |
p. 389-413
25 p.
|
article
|
| 123 |
Planning as Propositional CSP: From Walksat to Local Search Techniques for Action Graphs
|
Gerevini, Alfonso
|
|
2003
|
|
4 |
p. 389-413
|
article
|
| 124 |
Portfolio approaches in constraint programming
|
Amadini, Roberto
|
|
2015
|
|
4 |
p. 483
|
article
|
| 125 |
Preference reasoning with soft constraints in constraint-based recommender systems
|
Zanker, Markus
|
|
2010
|
|
4 |
p. 574-595
|
article
|
| 126 |
Probabilistic constraint reasoning
|
Carvalho, Elsa
|
|
2015
|
|
4 |
p. 509-510
|
article
|
| 127 |
Probe Backtrack Search for Minimal Perturbation in DynamicScheduling
|
Hani El Sakkout
|
|
2000
|
|
4 |
p. 359-388
30 p.
|
article
|
| 128 |
Probe Backtrack Search for Minimal Perturbation in Dynamic Scheduling
|
Sakkout, Hani El
|
|
2000
|
|
4 |
p. 359-388
|
article
|
| 129 |
Propagation techniques of resource constraint for cumulative scheduling
|
Kameugne, Roger
|
|
2015
|
|
4 |
p. 506-507
|
article
|
| 130 |
Random Constraint Satisfaction: A More Accurate Picture
|
Dimitris Achlioptas
|
|
2001
|
|
4 |
p. 329-344
16 p.
|
article
|
| 131 |
Random Constraint Satisfaction: A More Accurate Picture
|
Achlioptas, Dimitris
|
|
2001
|
|
4 |
p. 329-344
|
article
|
| 132 |
Random Constraint Satisfaction: Flaws and Structure
|
Ian P. Gent
|
|
2001
|
|
4 |
p. 345-372
28 p.
|
article
|
| 133 |
Random Constraint Satisfaction: Flaws and Structure
|
Gent, Ian P.
|
|
2001
|
|
4 |
p. 345-372
|
article
|
| 134 |
Range-only SLAM with indistinguishable landmarks; a constraint programming approach
|
Jaulin, Luc
|
|
2015
|
|
4 |
p. 557-576
|
article
|
| 135 |
Redundant disequalities in the Latin Square problem
|
Demoen, Bart
|
|
2013
|
|
4 |
p. 471-477
|
article
|
| 136 |
Reformulation of Global Constraints Based on Constraints Checkers
|
Beldiceanu, Nicolas
|
|
2005
|
|
4 |
p. 339-362
|
article
|
| 137 |
Resolution-based lower bounds in MaxSAT
|
Li, Chu Min
|
|
2010
|
|
4 |
p. 456-484
|
article
|
| 138 |
Resource Constraints for Preemptive Job-shop Scheduling
|
CLAUDE LE PAPE
|
|
1998
|
|
4 |
p. 263-287
25 p.
|
article
|
| 139 |
Resource Constraints for Preemptive Job-shop Scheduling
|
Pape, Claude Le
|
|
1998
|
|
4 |
p. 263-287
|
article
|
| 140 |
Robustness and stability in dynamic constraint satisfaction problems
|
Climent, Laura
|
|
2015
|
|
4 |
p. 502-503
|
article
|
| 141 |
Scaling DCOP algorithms for cooperative multi-agent coordination
|
Pujol-Gonzalez, Marc
|
|
2015
|
|
4 |
p. 496-497
|
article
|
| 142 |
Scheduling of Time-Triggered Real-Time Systems
|
Klaus Schild
|
|
2000
|
|
4 |
p. 335-357
23 p.
|
article
|
| 143 |
Scheduling of Time-Triggered Real-Time Systems
|
Schild, Klaus
|
|
2000
|
|
4 |
p. 335-357
|
article
|
| 144 |
Scheduling under Labour Resource Constraints
|
Susanne Heipcke
|
|
2000
|
|
4 |
p. 415-422
8 p.
|
article
|
| 145 |
Scheduling under Labour Resource Constraints
|
Heipcke, Susanne
|
|
2000
|
|
4 |
p. 415-422
|
article
|
| 146 |
Search, propagation, and learning in sequencing and scheduling problems
|
Siala, Mohamed
|
|
2015
|
|
4 |
p. 479-480
|
article
|
| 147 |
Short- and medium-term optimization of underground mine planning using constraint programming
|
Campeau, Louis-Pierre
|
|
|
|
4 |
p. 414-431
|
article
|
| 148 |
Side-channel cryptographic attacks using pseudo-boolean optimization
|
Oren, Yossef
|
|
2015
|
|
4 |
p. 616-645
|
article
|
| 149 |
Solution sampling with random table constraints
|
Vavrille, Mathieu
|
|
|
|
4 |
p. 381-413
|
article
|
| 150 |
Solving satisfiability problems with preferences
|
Di Rosa, Emanuele
|
|
2010
|
|
4 |
p. 485-515
|
article
|
| 151 |
Solving the quorumcast routing problem by constraint programming
|
Pham, Quang Dung
|
|
2012
|
|
4 |
p. 409-431
|
article
|
| 152 |
Spatio-temporal Conflict Detection and Resolution
|
Richard J. Howarth
|
|
1998
|
|
4 |
p. 343-361
19 p.
|
article
|
| 153 |
Spatio-temporal Conflict Detection and Resolution
|
Howarth, Richard J.
|
|
1998
|
|
4 |
p. 343-361
|
article
|
| 154 |
Statistical Regimes Across Constrainedness Regions
|
Gomes, Carla P.
|
|
2005
|
|
4 |
p. 317-337
|
article
|
| 155 |
Strong consistencies for weighted constraint satisfaction problems
|
Nguyen, Thi Hong Hiep
|
|
2015
|
|
4 |
p. 471-472
|
article
|
| 156 |
STR2: optimized simple tabular reduction for table constraints
|
Lecoutre, Christophe
|
|
2011
|
|
4 |
p. 341-371
|
article
|
| 157 |
SymChaff: exploiting symmetry in a structure-aware satisfiability solver
|
Sabharwal, Ashish
|
|
2008
|
|
4 |
p. 478-505
|
article
|
| 158 |
Symmetries, almost symmetries, and lazy clause generation
|
Chu, Geoffrey
|
|
2014
|
|
4 |
p. 434-462
|
article
|
| 159 |
Theoretical insights and algorithmic tools for decision diagram-based optimization
|
Bergman, David
|
|
2016
|
|
4 |
p. 533-556
|
article
|
| 160 |
Three generalizations of the FOCUS constraint
|
Narodytska, Nina
|
|
2015
|
|
4 |
p. 495-532
|
article
|
| 161 |
Towards next generation sequential and parallel SAT solvers
|
Manthey, Norbert
|
|
2015
|
|
4 |
p. 504-505
|
article
|
| 162 |
Transformations of representation in constraint satisfaction
|
Salamon, András Z.
|
|
2015
|
|
4 |
p. 500-501
|
article
|
| 163 |
Translation-based approaches for solving disjunctive temporal problems with preferences
|
Giunchiglia, Enrico
|
|
2018
|
|
4 |
p. 383-402
|
article
|
| 164 |
View-based propagation of decomposable constraints
|
Correia, Marco
|
|
2013
|
|
4 |
p. 579-608
|
article
|
Journal description