| Strengthening Neighbourhood Substitution
|
2020 |
Cooper, Martin C. |
| On Relation Between Constraint Propagation and Block-Coordinate Descent in Linear Programs
|
2020 |
Dlask, Tomáš |
| A Time Leap Challenge for SAT-Solving
|
2020 |
Fichte, Johannes K. |
| Breaking Symmetries with RootClique and LexTopSort
|
2020 |
Fichte, Johannes K. |
| Phase Transition Behavior in Knowledge Compilation
|
2020 |
Gupta, Rahul |
| Core-Guided Model Reformulation
|
2020 |
Leo, Kevin |
| Using Resolution Proofs to Analyse CDCL Solvers
|
2020 |
Kokkala, Janne I. |
| Filtering Rules for Flow Time Minimization in a Parallel Machine Scheduling Problem
|
2020 |
Nattaf, Margaux |
| A Branch-and-bound Algorithm to Rigorously Enclose the Round-Off Errors
|
2020 |
Garcia, Rémy |
| Using Constraint Programming to Generate Benzenoid Structures in Theoretical Chemistry
|
2020 |
Carissan, Yannick |
| Computing the Local Aromaticity of Benzenoids Thanks to Constraint Programming
|
2020 |
Carissan, Yannick |
| RobTest: A CP Approach to Generate Maximal Test Trajectories for Industrial Robots
|
2020 |
Collet, Mathieu |
| Parity (XOR) Reasoning for the Index Calculus Attack
|
2020 |
Trimoska, Monika |
| Generating Random Logic Programs Using Constraint Programmig
|
2020 |
Dilkas, Paulius |
| Solving Satisfaction Problems Using Large-Neighbourhood Search
|
2020 |
Björdal, Gustav |
| Pure MaxSAT and Its Applications to Combinatorial Optimization via Linear Local Search
|
2020 |
Cai, Shaowei |
| Quantum-Accelerated Global Constraint Filtering
|
2020 |
Booth, Kyle E. C. |
| Tractable Fragments of Temporal Sequences of Topological Information
|
2020 |
Cohen-Solal, Quentin |
| Bounding Linear Programs by Constraint Propagation: Application to Max-SAT
|
2020 |
Dlask, Tomáš |
| Aggregation and Garbage Collection for Online Optimization
|
2020 |
Ek, Alexander |
Tag hinzufügen