default search action
Constraints - An International Journal, Volume 28
Volume 28, Number 1, March 2023
- Matteo Zavatteri, Alice Raffaele, Dario Ostuni, Romeo Rizzi:
An interdisciplinary experimental evaluation on the disjunctive temporal problem. 1-12 - Rustem Takhanov:
The algebraic structure of the densification and the sparsification tasks for CSPs. 13-44 - Anissa Kheireddine, Etienne Renault, Souheib Baarir:
Towards better heuristics for solving bounded model checking problems. 45-66
Volume 28, Number 2, June 2023
- Edward Lam:
Hybrid optimization of vehicle routing problems. 67-68 - Tomás Dlask:
Block-coordinate descent and local consistencies in linear programming. 69-70 - 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. 71-104 - Manuel Bodirsky, Jakub Bulín, Florian Starke, Michael Wernthaler:
The smallest hard trees. 105-137 - Ágnes Cseh, Guillaume Escamocher, Luis Quesada:
Computing relaxations for the three-dimensional stable matching problem with cyclic preferences. 138-165 - Pouya Shati, Eldan Cohen, Sheila A. McIlraith:
SAT-based optimal classification trees for non-binary data. 166-202 - 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. 203-243 - Tomás Dlask, Tomás Werner:
Activity propagation in systems of linear inequalities and its relation to block-coordinate descent in linear programs. 244-276 - Tomás Dlask, Tomás Werner, Simon de Givry:
Super-reparametrizations of weighted CSPs: properties and optimization perspective. 277-319 - Marie-Louise Lackner, Christoph Mrkvicka, Nysret Musliu, Daniel Walkiewicz, Felix Winter:
Exact methods for the Oven Scheduling Problem. 320-361
Volume 28, Number 3, September 2023
- Rocsildes Canoy, Víctor Bucarey, Jayanta Mandi, Tias Guns:
Learn and route: learning implicit preferences for vehicle routing. 363-396 - Felix Ulrich-Oltean, Peter Nightingale, James Alfred Walker:
Learning to select SAT encodings for pseudo-Boolean and linear integer constraints. 397-426 - Christian Bessiere, Clément Carbonnel, Martin C. Cooper, Emmanuel Hebrard:
Complexity of minimum-size arc-inconsistency explanations. 427-449 - Jan Dreier, Sebastian Ordyniak, Stefan Szeider:
CSP beyond tractable constraint languages. 450-471 - Utku Umur Acikalin, Bugra Çaskurlu, K. Subramani:
Security-Aware Database Migration Planning. 472-505 - Kyle E. C. Booth:
Constraint programming approaches to electric vehicle and robot routing problems. 506-507 - Gustav Björdal:
From declarative models to local search. 508-509 - Jordi Coll Caballero:
Scheduling through logic-based tools. 510 - Margarita P. Castro:
Optimization methods based on decision diagrams for constraint programming, AI planning, and mathematical programming. 511-512 - Mohamed Sami Cherif:
Reasoning and inference for (Maximum) satisfiability: new insights. 513-514 - Rémy Garcia:
Floating-point numbers round-off error analysis by constraint programming. 515 - Pierre Talbot:
Spacetime programming: a synchronous language for constraint search. 516-517 - Hélène Verhaeghe:
The extensional constraint. 518 - Mathieu Vavrille, Charlotte Truchet, Charles Prud'homme:
Correction to: Solution sampling with random table constraints. 519
Volume 28, Number 4, December 2023
- Mathieu Vavrille:
A feature commonality-based search strategy to find high t-wise covering solutions in feature models. 521-548 - Justin J. Boutilier, Carla Michini, Zachary Zhou:
Optimal multivariate decision trees. 549-577
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.