Combinatorial Optimization Problems with Soft and Hard Requirements

Abstract

In this paper, the authors describe a heuristic principle for the solution of an important class of problems. Using real-world examples, it is then shown how some difficult combinatorial problems are modelled and solved by the suggested principle. In one case, a detailed discussion of the implementation of the solution is also provided.

Keywords:

• heuristics
• integer programming
• multiobjective optimization
• resource allocation
• scheduling