Abstract. In this paper we propose an optimal anytime version of constrained simulated annealing (CSA) for solving constrained nonlinear programming problems (NLPs). One of the goa...
We investigate issues regarding two hard problems related to voting, the optimal weighted lobbying problem and the winner problem for Dodgson elections. Regarding the former, Chris...
Interest in DNA computing has increased overwhelmly since Adleman successfully demonstrated its capability to solve Hamiltonian Path Problem (HPP). Many research results of similar...
Mohd Saufee Muhammad, Zuwairie Ibrahim, Satomi Ued...
We consider the generalized assignment problem in which the objective is to find a minimum cost assignment of a set of jobs to a set of agents subject to resource constraints. Th...
We describe a general approach to optimization which we term Squeaky Wheel" Optimization SWO. In SWO, a greedy algorithm is used to construct a solution which is then analyze...