Combinatorial Optimization is an important area of computer science that has many
theoretical and practical applications. In this thesis, we present important contributions to …

In this paper, we propose a general framework for combining deep neural networks (DNNs)
with dynamic programming to solve combinatorial optimization problems. For problems that …

Dominance breaking is a powerful technique in improving the solving efficiency of
Constraint Optimization Problems (COPs) by removing provably suboptimal solutions with …

This article describes applications of modern heuristic search methods to pattern
sequencing problems ie problems seeking for a permutation of the rows of a given matrix …

We give a dynamic programming solution to the problem of scheduling scenes to minimize
the cost of the talent. Starting from a basic dynamic program, we show a number of ways to …

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 …

Creating a movie shoot schedule is an important part of the movie production process. Even
for a small movie project already 50 activities requiring 130 resources such as different …

This paper provides a review of recent results on machine scheduling problems solved by
methods of submodular optimization. We present some basic definitions of submodular …

Memetic algorithms (MAs) constitute a metaheuristic optimization paradigm based on the
systematic exploitation of knowledge about the problem being solved, and the synergistic …

We present the talent scheduling problem and provide several hybrid genetic search
algorithms for solving this problem. The problem is of scheduling the independent activities …