The set covering problem is a formal model for many practical optimization problems. In the
set covering problem the goal is to choose a subset of the columns of minimal cost that …

Phase Change Memory (PCM) and spin-transfer torque random access memory (STT-RAM)
are emerging as new memory technologies to replace DRAM and NAND flash that are …

Abstract The Software Project Scheduling Problem is a specific Project Scheduling Problem
present in many industrial and academic areas. This problem consists in making the …

In this paper, we present a new Artificial Bee Colony algorithm to solve the non-unicost Set
Covering Problem. The Artificial Bee Colony algorithm is a recent metaheuristic technique …

The Sudoku is a famous logic‐placement game, originally popularized in Japan and today
widely employed as pastime and as testbed for search algorithms. The classic Sudoku …

Subset problems (set partitioning, packing, and covering) are formal models for many
practical optimization problems. A set partitioning problem determines how the items in one …

Solving constraint satisfaction problems via constraint programming involves the exploration
of a search tree where the potential solutions are distributed. The exploration phase is …

The nurse rostering problem consists in generating a configuration of daily schedules for a
set of nurses satisfying a set of constraints. The problem is known to be computationally …

Sažetak The variable and value ordering heuristics are a key element in Constraint
Programming. Known together as the enumeration strategy they may have important …

Abstract The Weighted Set Covering Problem is a formal model for many practical
optimization problems. In this problem the goal is to choose a subset of columns of minimal …