Quantum computers have demonstrable ability to solve problems at a scale beyond brute-
force classical simulation. Interest in quantum algorithms has developed in many areas …

Recent advances in quantum computers are demonstrating the ability to solve problems at a
scale beyond brute force classical simulation. As such, a widespread interest in quantum …

We propose domain-independent dynamic programming (DIDP) and constraint
programming (CP) models to exactly solve type 1 and type 2 assembly line balancing …

Dynamic programming (DP) is a framework used in multiple disciplines to solve decision-
making problems. In particular, in computer science and operations research (OR), DP …

Domain-independent dynamic programming (DIDP), a model-based paradigm based on
dynamic programming, has shown promising performance on multiple combinatorial …

When a transportation service accommodates both people and goods, operators sometimes
opt for vehicles that can be dynamically reconfigured for different demands. Motivated by air …

The quadratic traveling salesperson problem (QTSP) is a generalization of the traveling
salesperson problem, in which all triples of consecutive customers in a tour determine the …

Abstract We investigate using Constraint Programming (CP) and Domain-Independent
Dynamic Programming (DIDP) to solve the master problem in Logic-based Benders …

Large neighborhood search (LNS) is an algorithmic framework that removes a part of a
solution and performs search in the induced search space to find a better solution. While …

We introduce CODD, a system for solving combinatorial optimization problems using
decision diagram technology. Problems are represented as state-based dynamic …