Linked e-resources
Details
Table of Contents
A Two-Phase Hybrid Approach for the Hybrid Flexible Flowshop with Transportation Times
A SAT Encoding to compute Aperiodic Tiling Rhythmic Canons
Transferring Information across Restarts in MIP
Towards Copeland Optimization in Combinatorial Problems
Coupling Different Integer Encodings for SAT
Model-Based Algorithm Configuration with Adaptive Capping and Prior Distributions
Shattering Inequalities for Learning Optimal Decision Trees
Learning Pseudo-Backdoors for Mixed Integer Programs
Leveraging Integer Linear Programming to Learn Optimal Fair Rule Lists
Solving the Job Shop Scheduling Problem extended with AGVs ⁰́₃ Classical and Quantum Approaches
Stochastic Decision Diagrams
Improving the robustness of EPS to solve the TSP
Efficient operations between MDDs and constraints
Deep Policy Dynamic Programming for Vehicle Routing Problems
Learning a Propagation Complete Formula
A FastMap-Based Algorithm for Block Modeling
Packing by Scheduling: Using Constraint Programming to Solve a Complex 2D Cutting Stock Problem
Dealing with the product constraint
Multiple-choice knapsack constraint in graphical models
A Learning Large Neighborhood Search for the Staff Rerostering Problem
Practically Uniform Solution Sampling in Constraint Programming
Training Thinner and Deeper Neural Networks: Jumpstart Regularization
Hybrid Offline/Online Optimization for Energy Management via Reinforcement Learning
Enumerated Types and Type Extensions for MiniZinc
A parallel algorithm for generalized arc-consistent filtering for the Alldifferent constraint
Analyzing the Reachability Problem in Choice Networks
Model-based Approaches to Multi-Attribute Diverse Matching.
A SAT Encoding to compute Aperiodic Tiling Rhythmic Canons
Transferring Information across Restarts in MIP
Towards Copeland Optimization in Combinatorial Problems
Coupling Different Integer Encodings for SAT
Model-Based Algorithm Configuration with Adaptive Capping and Prior Distributions
Shattering Inequalities for Learning Optimal Decision Trees
Learning Pseudo-Backdoors for Mixed Integer Programs
Leveraging Integer Linear Programming to Learn Optimal Fair Rule Lists
Solving the Job Shop Scheduling Problem extended with AGVs ⁰́₃ Classical and Quantum Approaches
Stochastic Decision Diagrams
Improving the robustness of EPS to solve the TSP
Efficient operations between MDDs and constraints
Deep Policy Dynamic Programming for Vehicle Routing Problems
Learning a Propagation Complete Formula
A FastMap-Based Algorithm for Block Modeling
Packing by Scheduling: Using Constraint Programming to Solve a Complex 2D Cutting Stock Problem
Dealing with the product constraint
Multiple-choice knapsack constraint in graphical models
A Learning Large Neighborhood Search for the Staff Rerostering Problem
Practically Uniform Solution Sampling in Constraint Programming
Training Thinner and Deeper Neural Networks: Jumpstart Regularization
Hybrid Offline/Online Optimization for Energy Management via Reinforcement Learning
Enumerated Types and Type Extensions for MiniZinc
A parallel algorithm for generalized arc-consistent filtering for the Alldifferent constraint
Analyzing the Reachability Problem in Choice Networks
Model-based Approaches to Multi-Attribute Diverse Matching.