TALK KEYWORD INDEX

This page contains an index consisting of author-provided keywords.

# | |

#QBF | |

A | |

Active learning | |

Aggregate Dynamic Programming | |

allocation problem | |

Answer set programming | |

arithmetic constraints | |

Assembly line design | |

automatic configuration | |

Autonomous Trucking | |

B | |

Baysian Network | |

Benzenoid Generation Problem | |

Binary Constraint Tree | |

Binary CSP | |

Binary Decision Diagram | |

black-box external function | |

Boolean network | |

Branching heuristics | |

BT compilation | |

C | |

Canonical code | |

certified optimality | |

Classification | |

cliques | |

combinatorial design | |

combinatorial optimization | |

Compactness | |

Computational systems biology | |

computer-assisted proofs | |

Conflict Analysis | |

constrained-based combinatorics | |

Constraint Acquisition | |

Constraint Learning | |

constraint modeling | |

Constraint optimization problem | |

Constraint programming | |

constraint satisfaction problem | |

Constraint Satisfaction Problems | |

cube-and-conquer | |

Cumulative Scheduling | |

Cutting Planes Proof System | |

D | |

Decision Diagrams | |

decision set | |

deduction | |

Deep Optimization | |

Deep reinforcement learning | |

Dial-a-ride problem | |

directed graph | |

Discrete Optimization | |

Division | |

Domain Specific Languages | |

Dynamic Programming | |

E | |

Edge Finding Rule | |

explanation | |

extensional constraints | |

F | |

Facility location | |

fast matrix multiplication | |

FastMapSVM | |

finite model enumeration | |

Fixed point | |

formal explanations | |

Fund Allocation | |

G | |

gradient boosting tree | |

Graph | |

H | |

Horizontally Elastic Scheduling | |

Human-Centric Optimisation | |

Hydrogen Supply Chain | |

I | |

ILP | |

imbalance | |

Incremental constrained clustering | |

Industrial application | |

Industry 4.0 | |

Integer Programming | |

Interactive | |

interpretable model | |

L | |

Large Neighborhood Search | |

Large-scale scheduling problem | |

Latin squares | |

least number heuristic | |

Local Search | |

M | |

Machine Learning | |

maximum satisfiability | |

MaxSAT | |

maxsat evaluation | |

Mine planning | |

MiniZinc | |

Mixed integer programming | |

Mixed Integer Rounding | |

Model Counting | |

Modeling | |

Modelling | |

Multi-mode | |

Multi-objective | |

multi-objective combinatorial optimization | |

multi-objective constraint programming | |

Multi-skill | |

Multi-valued decision diagram | |

Multivalued Decision Diagrams | |

N | |

Numeric Data | |

O | |

Optimisation | |

Optimization | |

P | |

p-dispersion | |

parallel algorithm | |

Pareto optimality | |

Partial preemption | |

partially spatially balanced Latin rectangles | |

Pickup and delivery | |

polygon cover | |

Polynomial Equivalence | |

Preemptive Resources | |

preprocessing | |

Probabilistic Network | |

Problem Drift | |

Profile | |

proof logging | |

propagation | |

Pseudo-Boolean Optimization | |

Pseudo-Boolean Reasoning | |

Q | |

Quantified Boolean Formulas | |

Quantum computing | |

Qubit routing | |

R | |

random variables | |

Redcap | |

redundancy | |

Regionalization | |

Resource calendars | |

S | |

SAT encodings | |

SAT solving | |

satellite imaging | |

Saturation | |

Scheduling | |

Scoring Function | |

Search | |

set cover | |

Short-term planning | |

Solution Counting | |

Solving | |

spatially balanced Latin rectangles | |

State Space Search | |

Stochastic | |

Stochastic Local Search | |

Structured Decomposability | |

Strucured DNNF | |

subgraph isomorphism | |

symmetry breaking | |

symmetry-breaking | |

T | |

TimeTable | |

tournament | |

Transfer Hub Network | |

U | |

under-approximation | |

Underground mine | |

User feedback | |

V | |

Variable Ordering Heuristics | |

Variable Weighting | |

W | |

Water flow control | |

Weighting Scheme |