Optimization applications of Goldbach's conjecture.

Goldbach's conjecture is an unsolved legendary problem. In this paper, we investigate an optimization problem as an attempt to discuss potential applications of the conjecture. In an optimization perspective, the research question, modelled from design of base components, is to select a minimum number of primes to span a given set of target even integers.

Unifying colors by primes.

RGB and CYMK are two major coloring schemes currently available for light colors and pigment colors, respectively. Both systems use letter-based color codes that require a large range of values to represent different colors. The problem is that these two systems are hard to use for manipulating any operations involving combinations of colors, and they lack the capacity for inter-changeability or unification.

Scheduling of Anaesthesia Operations in Operating Rooms.

This paper considers scheduling of surgical operations across multiple operating rooms subject to the limited availability of anaesthetists. The objective is to construct a feasible operations schedule that has the minimum makespan, i.e.

Discrete particle swarm optimization with scout particles for library materials acquisition.

Materials acquisition is one of the critical challenges faced by academic libraries. This paper presents an integer programming model of the studied problem by considering how to select materials in order to maximize the average preference and the budget execution rate under some practical restrictions including departmental budget, limitation of the number of materials in each category and each language. To tackle the constrained problem, we propose a discrete particle swarm optimization (DPSO) with scout particles, where each particle, represented as a binary matrix, corresponds to a candidate solution to the problem.