In 1994, Harn proposed a signature scheme based on the modified ElGamal's scheme and claimed that the security relies on both of the factorization and the discrete logarithm....
In this article we answer the complexity question of two dual criteria scheduling problems which had been open for a long time. Both problems are single machine scheduling problem...
The dynamic optimization problem concerns finding an optimum in a changing environment. In the tracking problem, the optimizer should be able to follow the optimum’s changes ov...
Claudio Rossi, Antonio Barrientos, Jaime del Cerro
Abstract. We define and study two versions of the bipartite matching problem in the framework of two-stage stochastic optimization with recourse. In one version the uncertainty is...
The car sequencing problem involves scheduling cars along an assembly line while satisfying capacity constraints. In this paper, we describe an Ant Colony Optimization (ACO) algor...