Abstract is missing.
- Constraint Programming and a Usability QuestLaurent D. Michel. 1 [doi]
- Optimization Challenges in Smart Grid OperationsMiguel F. Anjos. 2-3 [doi]
- Where Are the Interesting Problems?Barry O'Sullivan. 4-5 [doi]
- A Generic Method for Identifying and Exploiting Dominance RelationsGeoffrey Chu, Peter J. Stuckey. 6-22 [doi]
- Scheduling Scientific Experiments on the Rosetta/Philae MissionGilles Simonin, Christian Artigues, Emmanuel Hebrard, Pierre Lopez. 23-37 [doi]
- Max-Sur-CSP on Two ElementsHannes Uppman. 38-54 [doi]
- An Optimal Arc Consistency Algorithm for a Chain of Atmost Constraints with CardinalityMohamed Siala 0002, Emmanuel Hebrard, Marie-José Huguet. 55-69 [doi]
- Conflict Directed Lazy DecompositionIgnasi Abío, Peter J. Stuckey. 70-85 [doi]
- Improving SAT-Based Weighted MaxSAT SolversCarlos Ansótegui, Maria Luisa Bonet, Joel Gabàs, Jordi Levy. 86-101 [doi]
- Distributed Tree Decomposition with PrivacyVincent Armant, Laurent Simon, Philippe Dague. 102-117 [doi]
- Refining Restarts Strategies for SAT and UNSATGilles Audemard, Laurent Simon. 118-126 [doi]
- Boosting Local Consistency Algorithms over Floating-Point NumbersMohammed Said Belaid, Claude Michel, Michel Rueher. 127-140 [doi]
- A Model Seeker: Extracting Global Constraint Models from Positive ExamplesNicolas Beldiceanu, Helmut Simonis. 141-157 [doi]
- On Computing Minimal Equivalent SubformulasAnton Belov, Mikolás Janota, Inês Lynce, João Marques-Silva. 158-174 [doi]
- Including Soft Global Constraints in DCOPsChristian Bessiere, Patricia Gutierrez, Pedro Meseguer. 175-190 [doi]
- The Weighted Average ConstraintAlessio Bonfietti, Michele Lombardi. 191-206 [doi]
- Weibull-Based Benchmarks for Bin PackingIgnacio Castiñeiras, Milan De Cauwer, Barry O'Sullivan. 207-222 [doi]
- Space-Time Tradeoffs for the Regular ConstraintKenil C. K. Cheng, Wei Xia, Roland H. C. Yap. 223-237 [doi]
- Inter-instance Nogood Learning in Constraint ProgrammingGeoffrey Chu, Peter J. Stuckey. 238-247 [doi]
- Solving Temporal Problems Using SMT: Strong ControllabilityAlessandro Cimatti, Andrea Micheli, Marco Roveri. 248-264 [doi]
- A Characterisation of the Complexity of Forbidding Subproblems in Binary Max-CSPMartin C. Cooper, Guillaume Escamocher, Stanislav Zivny. 265-273 [doi]
- Optimisation Modelling for Software DevelopersKathryn Francis, Sebastian Brand, Peter J. Stuckey. 274-289 [doi]
- Adaptive Bisection of Numerical CSPsLaurent Granvilliers. 290-298 [doi]
- Resource Constrained Shortest Paths with a Super Additive Objective FunctionStefano Gualandi, Federico Malucelli. 299-315 [doi]
- Relating Proof Complexity Measures and Practical Hardness of SATMatti Järvisalo, Arie Matsliah, Jakob Nordström, Stanislav Zivny. 316-331 [doi]
- The SeqBin Constraint RevisitedGeorge Katsirelos, Nina Narodytska, Toby Walsh. 332-347 [doi]
- Eigenvector Centrality in Industrial SAT InstancesGeorge Katsirelos, Laurent Simon. 348-356 [doi]
- Classifying and Propagating Parity ConstraintsTero Laitinen, Tommi A. Junttila, Ilkka Niemelä. 357-372 [doi]
- Consistencies for Ultra-Weak Solutions in Minimax Weighted CSPs Using the Duality PrincipleArnaud Lallouet, Jimmy Ho-Man Lee, Terrence W. K. Mak. 373-389 [doi]
- Propagating Soft Table ConstraintsChristophe Lecoutre, Nicolas Paris, Olivier Roussel, Sébastien Tabary. 390-405 [doi]
- WCSP Integration of Soft Neighborhood SubstitutabilityChristophe Lecoutre, Olivier Roussel, Djamel E. Dehani. 406-421 [doi]
- Increasing Symmetry Breaking by Preserving Target SymmetriesJimmy Ho-Man Lee, Jingying Li. 422-438 [doi]
- A Scalable Sweep Algorithm for the cumulative ConstraintArnaud Letort, Nicolas Beldiceanu, Mats Carlsson. 439-454 [doi]
- A New Encoding from MinSAT into MaxSATZhu Zhu, Chu Min Li, Felip Manyà, Josep Argelich. 455-463 [doi]
- Solving Minimal Constraint Networks in Qualitative Spatial and Temporal ReasoningWeiming Liu, Sanjiang Li. 464-479 [doi]
- Containment, Equivalence and Coreness from CSP to QCSP and BeyondFlorent R. Madelaine, Barnaby Martin. 480-495 [doi]
- An Optimal Filtering Algorithm for Table ConstraintsJean-Baptiste Mairy, Pascal Van Hentenryck, Yves Deville. 496-511 [doi]
- Parallel SAT Solver Selection and SchedulingYuri Malitsky, Ashish Sabharwal, Horst Samulowitz, Meinolf Sellmann. 512-526 [doi]
- Constraint Satisfaction over Bit-VectorsLaurent D. Michel, Pascal Van Hentenryck. 527-543 [doi]
- Towards Solver-Independent PropagatorsJean-Noël Monette, Pierre Flener, Justin Pearson. 544-560 [doi]
- Interactive Algorithm for Multi-Objective Constraint OptimizationTenda Okimoto, Yongjoon Joe, Atsushi Iwasaki, Toshihiro Matsui, Katsutoshi Hirayama, Makoto Yokoo. 561-576 [doi]
- Focus : A Constraint for Concentrating High CostsThierry Petit. 577-592 [doi]
- Refining Abstract Interpretation Based Value Analysis with Constraint Programming TechniquesOlivier Ponsini, Claude Michel, Michel Rueher. 593-607 [doi]
- Time-Dependent Simple Temporal NetworksCédric Pralet, Gérard Verfaillie. 608-623 [doi]
- Improved Bounded Max-Sum for Distributed Constraint OptimizationEmma Rollon, Javier Larrosa. 624-632 [doi]
- A Hybrid MIP/CP Approach for Multi-activity Shift SchedulingDomenico Salvagnin, Toby Walsh. 633-646 [doi]
- Contributions to the Theory of Practical Quantified Boolean Formula SolvingAllen Van Gelder. 647-663 [doi]
- Breaking Variable Symmetry in Almost Injective ProblemsPhilippe Vismara, Remi Coletta. 664-671 [doi]
- Understanding, Improving and Parallelizing MUS Finding Using Model RotationSiert Wieringa. 672-687 [doi]
- Revisiting Neighborhood Inverse Consistency on Binary CSPsRobert J. Woodward, Shant Karakashian, Berthe Y. Choueiry, Christian Bessiere. 688-703 [doi]
- Syntactically Characterizing Local-to-Global Consistency in ORD-HornMichal Wrona. 704-719 [doi]
- A Hybrid Paradigm for Adaptive Parallel SearchXi Yun, Susan L. Epstein. 720-734 [doi]
- A Constraint Programming Approach for the Traveling Purchaser ProblemHadrien Cambazard, Bernard Penz. 735-749 [doi]
- Constraint-Based Register Allocation and Instruction SchedulingRoberto Castañeda Lozano, Mats Carlsson, Frej Drejhammar, Christian Schulte. 750-766 [doi]
- Maximising the Net Present Value of Large Resource-Constrained ProjectsHanyu Gu, Peter J. Stuckey, Mark G. Wallace. 767-781 [doi]
- Comparing Solution Methods for the Machine Reassignment ProblemDeepak Mehta, Barry O'Sullivan, Helmut Simonis. 782-797 [doi]
- A Boolean Model for Enumerating Minimal Siphons and Traps in Petri NetsFaten Nabli, François Fages, Thierry Martinez, Sylvain Soliman. 798-814 [doi]
- Cardinality Reasoning for Bin-Packing Constraint: Application to a Tank Allocation ProblemPierre Schaus, Jean-Charles Régin, Rowan Van Schaeren, Wout Dullaert, Birger Raa. 815-822 [doi]
- The Offshore Resources Scheduling Problem: Detailing a Constraint Programming ApproachThiago Serra, Gilberto Nishioka, Fernando J. M. Marcellino. 823-839 [doi]
- Computational Protein Design as a Cost Function Network Optimization ProblemDavid Allouche, Seydou Traoré, Isabelle André, Simon de Givry, George Katsirelos, Sophie Barbe, Thomas Schiex. 840-849 [doi]
- A Filtering Technique for Fragment Assembly- Based Proteins Loop Modeling with ConstraintsFederico Campeotto, Alessandro Dal Palù, Agostino Dovier, Ferdinando Fioretto, Enrico Pontelli. 850-866 [doi]
- A Branch and Prune Algorithm for the Computation of Generalized Aspects of Parallel RobotsStéphane Caro, Damien Chablat, Alexandre Goldsztejn, Daisuke Ishii, Christophe Jermann. 867-882 [doi]
- The Semigroups of Order 10Andreas Distler, Christopher Jefferson, Tom Kelsey, Lars Kotthoff. 883-899 [doi]
- Exploring Chemistry Using SMTRolf Fagerberg, Christoph Flamm, Daniel Merkle, Philipp Peters. 900-915 [doi]
- A Pseudo-Boolean Set Covering MachinePascal Germain, Sébastien Giguère, Jean-Francis Roy, Brice Zirakiza, François Laviolette, Claude-Guy Quimper. 916-924 [doi]
- Finding a Nash Equilibrium by Asynchronous BacktrackingAlon Grubshtein, Amnon Meisels. 925-940 [doi]
- Reasoning over Biological Networks Using Maximum SatisfiabilityJoão Guerra, Inês Lynce. 941-956 [doi]
- Properties of Energy-Price Forecasts for SchedulingGeorgiana Ifrim, Barry O'Sullivan, Helmut Simonis. 957-972 [doi]
- Aggregating Conditionally Lexicographic Preferences on Multi-issue DomainsJérôme Lang, Jérôme Mengin, Lirong Xia. 973-987 [doi]
- Constraint Programming for Path Planning with Uncertainty - Solving the Optimal Search Path ProblemMichael Morin, Anika-Pascale Papillon, Irène Abi-Zeid, François Laviolette, Claude-Guy Quimper. 988-1003 [doi]
- Feature Term Subsumption Using Constraint Programming with Basic Variable SymmetrySantiago Ontañón, Pedro Meseguer. 1004-1012 [doi]