113 search results - page 10 / 23 » On solving a hard quadratic 3-dimensional assignment problem |
INFORMATICALT
2006
14 years 11 months ago
2006
Recently, genetic algorithms (GAs) and their hybrids have achieved great success in solving difficult combinatorial optimization problems. In this paper, the issues related to the ...
EOR
2007
14 years 11 months ago
2007
The Service Allocation Problem (SAP) is a tactical problem arising in the yard management of a container transshipment terminal. The objective is the minimization of the container...
CPAIOR
2010
Springer
15 years 3 months ago
2010
Springer
We introduce an approach which combines ACO (Ant Colony Optimization) and IBM ILOG CP Optimizer for solving COPs (Combinatorial Optimization Problems). The problem is modeled using...
CRYPTO
2006
Springer
15 years 2 months ago
2006
Springer
In the last ten years, multivariate cryptography has emerged as a possible alternative to public key cryptosystems based on hard computational problems from number theory. Notably,...
MFCS
2005
Springer
15 years 4 months ago
2005
Springer
In the maximum solution equation problem a collection of equations are given over some algebraic structure. The objective is to find an assignment to the variables in the equation...