The subject of this paper is the formulation and solution of a variation of the classical binary knapsack problem. The variation that is addressed is termed the ``fixed-charge kna...
Most previous research into the job-shop scheduling problem has concentrated on finding a single optimal solution (e.g., makespan), even though the actual requirement of most prod...
Abstract. In this work we introduce a new generalization of the ResourceConstrained Project Scheduling Problem – the Mobile Workforce Scheduling Problem with Multitask-Processes ...
We present a SAT-based approach to the task and message allocation problem of distributed real-time systems with hierarchical architectures. In contrast to the heuristic approache...
Abstract- Branch-and-Bound and evolutionary algorithms represent two very different approaches for tackling combinatorial optimization problems. These approaches are not incompatib...