Constraints

Volume 20, Issue 4, October 2015
Special issue on CSP Technologies in Artificial

Intelligence
Issue Editors:
ric Grgoire,
Bertrand Mazure
ISSN: 1383-7133 (Print) 1572-9354 (Online)
In this issue (29 articles)

previous Page
of 2
1. EditorialNotes
Introduction to the special issue on CSP technologies in artificial

intelligence
ric Grgoire, Bertrand Mazure Pages 381-382
Download PDF (59KB)
2.
OriginalPaper
A hybrid tractable class for non-binary CSPs

Achref El Mouelhi, Philippe Jgou, Cyril Terrioux Pages 383-413
Look Inside Get Access
3.
OriginalPaper
On getting rid of the preprocessing minimization step in MUCfinding algorithms

ric Grgoire, Jean-Marie Lagniez, Bertrand Mazure Pages 414-432
4.
OriginalPaper
A constraint programming approach to the additional relay

placement problem in wireless sensor networks
Luis Quesada, Lanny Sitanayah, Kenneth N. Brown, Barry OSullivan Pages
433-451

5.
OriginalPaper
Adaptive constructive interval disjunction: algorithms and

experiments
Bertrand Neveu, Gilles Trombettoni, Ignacio Araya Pages 452-467
6. Editors Note
PhD theses in constraints 20122015

Guido Tack, Christopher Mears Page 468
Download PDF (171KB)
7. Announcement for PhD Thesis
Parallel search for maximum satisfiability

Ruben Martins Pages 469-470
Download PDF (51KB)
Strong consistencies for weighted constraint satisfaction problems

Thi Hong Hiep Nguyen, Thomas Schiex, Christian Bessiere Pages 471-472
Download PDF (55KB)
Hybrid meta-heuristics for combinatorial optimization

Tommaso Urli Page 473
Download PDF (44KB)
Instance-specific algorithm configuration

Yuri Malitsky Page 474
Download PDF (43KB)
Efficient search procedures for solving combinatorial problems

Serdar Kadioglu Pages 475-476
Download PDF (77KB)
Constraints for membership in formal languages under

systematic search and stochastic local search
Jun He Pages 477-478
Download PDF (72KB)
Search, propagation, and learning in sequencing and scheduling

problems
Mohamed Siala Pages 479-480
Download PDF (51KB)
On Algorithm Selection, with an application to combinatorial

search problems
Lars Kotthoff Pages 481-482
Download PDF (51KB)
Portfolio approaches in constraint programming

Roberto Amadini Page 483
Download PDF (44KB)
Efficient algorithms for strong local consistencies and adaptive

techniques in constraint satisfaction problems
Anastasia Paparrizou Pages 484-485
Download PDF (56KB)
New techniques for discrete optimization

David Bergman Pages 486-487
Download PDF (52KB)
Constraints meet concurrency

Jacopo Mauro Pages 488-489
Download PDF (49KB)
Decision support for disaster management through hybrid

optimization
Carleton Coffrin Pages 490-491
Download PDF (50KB)
Declarative pattern mining using constraint programming

Tias Guns Pages 492-493
Download PDF (51KB)
previous Page
of 2
Look
Inside
Volume 20, Issue 3, July 2015


1. EditorialNotes
Introduction to the fast track issue for CPAIOR 2015

L. Michel Pages 283-284
Download PDF (59KB)
2.
OriginalPaper
A column-generation approach for joint mobilization and

evacuation planning
Victor Pillac, Manuel Cebrian, Pascal Van Hentenryck Pages 285-303
3.
OriginalPaper
A hybrid exact method for a scheduling problem with a

continuous resource and energy constraints
Margaux Nattaf, Christian Artigues, Pierre Lopez Pages 304-324

4.
OriginalPaper
A constraint-based local search backend for MiniZinc

Gustav Bjrdal, Jean-Nol Monette, Pierre Flener, Justin Pearson Pages 325-345
5.
OriginalPaper
Lagrangian bounds from decision diagrams

David Bergman, Andre A. Cire, Willem-Jan van Hoeve Pages 346-361
6.
OriginalPaper
New filtering for AtMostNValue and its weighted variant: A

Lagrangian approach
Hadrien Cambazard, Jean-Guillaume Fages Pages 362-380
Look
Inside
Volume 20, Issue 2, April 2015


1.
OriginalPaper
Ultra-weak solutions and consistency enforcement in minimax

weighted constraint satisfaction
Arnaud Lallouet, Jimmy H. M. Lee, Terrence W. K. Mak, Justin Yip Pages 109154

2. OriginalPaper
Dominance breaking constraints

Geoffrey Chu, Peter J. Stuckey Pages 155-182
3.
OriginalPaper
Synchronized sweep algorithms for scalable scheduling

constraints
Arnaud Letort, Mats Carlsson, Nicolas Beldiceanu Pages 183-234
4.
OriginalPaper
A method for detecting symmetries in constraint models and its

generalisation
Christopher Mears, Maria Garcia de la Banda, Mark Wallace, Bart Demoen
Pages 235-273

5.
Letter
Adding laziness in BnB-ADOPT+

Jimmy H. M. Lee, Pedro Meseguer, Wen Su Pages 274-282
Look
Inside
Volume 20, Issue 1, January 2015


1.
OriginalPaper
Solving strong controllability of temporal problems with

uncertainty using SMT
Alessandro Cimatti, Andrea Micheli, Marco Roveri Pages 1-29
2.
OriginalPaper
Large-scale parallelism for constraint-based local search: the

costas array case study
Yves Caniou, Philippe Codognet, Florian Richoux, Daniel Diaz, Salvador
Abreu Pages 30-56
3.
OriginalPaper
Hybrid metaheuristics for stochastic constraint programming

S. D. Prestwich, S. A. Tarim, R. Rossi, B. Hnich Pages 57-76
4.
Application
Scheduling scientific experiments for comet exploration

Gilles Simonin, Christian Artigues, Emmanuel Hebrard, Pierre Lopez Pages 7799

5.
Letter
Improving the lower bound of simple tabular reduction

Christophe Lecoutre, Chavalit Likitvivatanavong, Roland H. C. Yap Pages 100108
Look
Inside
Volume 19, Issue 4, October 2014


1.
OriginalPaper
Explanation-based large neighborhood search

Charles Prudhomme, Xavier Lorca, Narendra Jussien Pages 339-379
2.
OriginalPaper
meSAT: multiple encodings of CSP to SAT

Mirko Stojadinovi, Filip Mari Pages 380-403
3.
OriginalPaper
Graph coloring inequalities from all-different systems
David Bergman, J. N. Hooker Pages 404-433

4.
OriginalPaper
Symmetries, almost symmetries, and lazy clause generation

Geoffrey Chu, Maria Garcia de la Banda, Christopher Mears, Peter J. Stuckey
Pages 434-462
Look
Inside
Volume 19, Issue 3, July 2014


1.
OriginalPaper
Lightweight dynamic symmetry breaking

Christopher Mears, Maria Garcia de la Banda, Bart Demoen, Mark Wallace
Pages 195-242

2.
OriginalPaper
A quadratic edge-finding filtering algorithm for cumulative

resource constraints
Roger Kameugne, Laure Pauline Fotso, Joseph Scott, Youcheu Ngo-Kateu
Pages 243-269

3.
OriginalPaper
Consistency techniques for polytime linear global cost functions

in weighted constraint satisfaction
J. H. M. Lee, K. L. Leung, Y. W. Shum Pages 270-308
4.
OriginalPaper
The octagon abstract domain for continuous constraints

Marie Pelleau, Charlotte Truchet, Frdric Benhamou Pages 309-337
Look
Inside
Volume 19, Issue 2, April 2014
The Future of Constraint Programming

Issue Editors:
Michela Milano,
Pascal Van Hentenryck

1. EditorialNotes
Looking into the crystal-ball: a bright future for CP

Michela Milano, Pascal Van Hentenryck Pages 121-125
2.
OriginalPaper
The future of optimization technology

Maria Garcia de la Banda, Peter J. Stuckey, Pascal Van Hentenryck Pages
126-138

3.
OriginalPaper
Toward sustainable development in constraint programming

Nicolas Beldiceanu, Pierre Flener, Jean-Nol Monette, Justin Pearson Pages
139-149

4.
OriginalPaper
Grand challenges for constraint programming
Eugene C. Freuder, Barry OSullivan Pages 150-162

5.
OriginalPaper
Qualitative modelling via constraint programming

Thomas W. Kelsey, Lars Kotthoff, Christopher A. Jefferson, Stephen A.
Linton Pages 163-173
6.
OriginalPaper
Strategic decision making on complex systems

Michela Milano, Michele Lombardi Pages 174-185
7.
OriginalPaper
Collective decision making: a great opportunity for constraint

reasoning
Francesca Rossi Pages 186-194
Look
Inside
Volume 19, Issue 1, January 2014


1.
OriginalPaper
Explaining circuit propagation

Kathryn Glenn Francis, Peter J. Stuckey Pages 1-29
2.
OriginalPaper
An optimal arc consistency algorithm for a particular case of

sequence constraint
Mohamed Siala, Emmanuel Hebrard, Marie-Jos Huguet Pages 30-56
3.
OriginalPaper
Propagation engine prototyping with a domain specific language
Charles Prudhomme, Xavier Lorca, Rmi Douence, Narendra Jussien Pages

57-76

4.
OriginalPaper
Optimal and efficient filtering algorithms for table constraints

Jean-Baptiste Mairy, Pascal Van Hentenryck, Yves Deville Pages 77-120
Look
Inside

Constraints

Hochgeladen von

Dokumentinformationen

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

Constraints

Hochgeladen von

Copyright:

Verfügbare Formate

Volume 20, Issue 4, October 2015

Special issue on CSP Technologies in Artificial

ISSN: 1383-7133 (Print) 1572-9354 (Online)

In this issue (29 articles)

Introduction to the special issue on CSP technologies in artificial

A hybrid tractable class for non-binary CSPs

On getting rid of the preprocessing minimization step in MUCfinding algorithms

A constraint programming approach to the additional relay

Look Inside Get Access

Adaptive constructive interval disjunction: algorithms and

PhD theses in constraints 20122015

Parallel search for maximum satisfiability

Strong consistencies for weighted constraint satisfaction problems

Hybrid meta-heuristics for combinatorial optimization

Instance-specific algorithm configuration

Efficient search procedures for solving combinatorial problems

Constraints for membership in formal languages under

Search, propagation, and learning in sequencing and scheduling

On Algorithm Selection, with an application to combinatorial

15. Announcement for PhD Thesis

Portfolio approaches in constraint programming

Efficient algorithms for strong local consistencies and adaptive

New techniques for discrete optimization

Constraints meet concurrency

Decision support for disaster management through hybrid

Declarative pattern mining using constraint programming

Volume 20, Issue 3, July 2015

In this issue (6 articles)

Introduction to the fast track issue for CPAIOR 2015

A column-generation approach for joint mobilization and

A hybrid exact method for a scheduling problem with a

Margaux Nattaf, Christian Artigues, Pierre Lopez Pages 304-324

A constraint-based local search backend for MiniZinc

Lagrangian bounds from decision diagrams

New filtering for AtMostNValue and its weighted variant: A

Volume 20, Issue 2, April 2015

In this issue (5 articles)

Ultra-weak solutions and consistency enforcement in minimax

Look Inside Get Access

Dominance breaking constraints

Synchronized sweep algorithms for scalable scheduling

A method for detecting symmetries in constraint models and its

Look Inside Get Access

Adding laziness in BnB-ADOPT+

Volume 20, Issue 1, January 2015

In this issue (5 articles)

Solving strong controllability of temporal problems with

Large-scale parallelism for constraint-based local search: the

Hybrid metaheuristics for stochastic constraint programming

Scheduling scientific experiments for comet exploration

Look Inside Get Access

Improving the lower bound of simple tabular reduction

Look Inside Get Access

Volume 19, Issue 4, October 2014

In this issue (4 articles)

Explanation-based large neighborhood search

meSAT: multiple encodings of CSP to SAT

Graph coloring inequalities from all-different systems

David Bergman, J. N. Hooker Pages 404-433

Symmetries, almost symmetries, and lazy clause generation

Look Inside Get Access

Volume 19, Issue 3, July 2014

In this issue (4 articles)

Lightweight dynamic symmetry breaking