83 citations · 187 across the 9 of their papers we have counts for
10 papers
Domain-Independent Dynamic Programming with Constraint Propagation
Imko Marijnissen, J. Christopher Beck, Emir Demirović +1
There are two prevalent model-based paradigms for combinatorial problems: 1) state-based representations, such as heuristic search, dynamic programming (DP), and decision diagrams,…
Domain-Independent Dynamic Programming: Generic State Space Search for Combinatorial Optimization
Ryo Kuroiwa, J. Christopher Beck
For combinatorial optimization problems, model-based approaches such as mixed-integer programming (MIP) and constraint programming (CP) aim to decouple modeling and solving a probl…
Capacity Allocation for Clouds with Parallel Processing, Batch Arrivals, and Heterogeneous Service Requirements
Eugene Furman, Arik Senderovich, Shane Bergsma +1
Problem Definition: Allocating sufficient capacity to cloud services is a challenging task, especially when demand is time-varying, heterogeneous, contains batches, and requires mu…
Decision Diagrams for Discrete Optimization: A Survey of Recent Advances
Margarita P. Castro, Andre A. Cire, J. Christopher Beck
In the last decade, decision diagrams (DDs) have been the basis for a large array of novel approaches for modeling and solving optimization problems. Many techniques now use DDs as…
A Combinatorial Cut-and-Lift Procedure with an Application to 0-1 Second-Order Conic Programming
Margarita P. Castro, Andre A. Cire, J. Christopher Beck
Cut generation and lifting are key components for the performance of state-of-the-art mathematical programming solvers. This work proposes a new general cut-and-lift procedure that…
Comparing and Integrating Constraint Programming and Temporal Planning for Quantum Circuit Compilation
Kyle E. C. Booth, Minh Do, J. Christopher Beck +3
Recently, the makespan-minimization problem of compiling a general class of quantum algorithms into near-term quantum processors has been introduced to the AI community. The resear…
Scheduling a Dynamic Aircraft Repair Shop with Limited Repair Resources
Maliheh Aramon Bajestani, J. Christopher Beck
We address a dynamic repair shop scheduling problem in the context of military aircraft fleet management where the goal is to maintain a full complement of aircraft over the long-t…
A Constraint Programming Approach for Solving a Queueing Control Problem
Daria Terekhov, J. Christopher Beck
In a facility with front room and back room operations, it is useful to switch workers between the rooms in order to cope with changing customer demand. Assuming stochastic custome…
Solution-Guided Multi-Point Constructive Search for Job Shop Scheduling
J. C. Beck
Solution-Guided Multi-Point Constructive Search (SGMPCS) is a novel constructive search technique that performs a series of resource-limited tree searches where each search begins…
Proactive Algorithms for Job Shop Scheduling with Probabilistic Durations
J. C. Beck, N. Wilson
Most classical scheduling formulations assume a fixed and known duration for each activity. In this paper, we weaken this assumption, requiring instead that each duration can be re…