MAX-SAT, the optimisation variant of the satisfiability problem in propositional logic, is an important and widely studied combinatorial optimisation problem with applications in ...
Routing in computer networks is a nonlinear combinatorial optimization problem with numerous constraints and is classified as an NP-complete problem. There are certain important Qo...
Abstract—In this paper the author presents three approaches to parallel Tabu Search, applied to several instances of the Capacitated Vehicle Routing Problem with Time Windows (CV...
This paper addresses the problem of solving conflicts in railway traffic that arise due to disturbances. It is formulated as a problem of re-scheduling meets and overtakes of trai...
Abstract. Graph matching is often used for image recognition. Different kinds of graph matchings have been proposed such as (sub)graph isomorphism or error-tolerant graph matching...