3142 search results - page 83 / 629 » Solving Hierarchical Optimization Problems Using MOEAs |
129
click to vote
CPAIOR
2010
Springer
15 years 8 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...
131
click to vote
EOR
2008
15 years 3 months ago
2008
Passengers travelling in public transportation networks often have to use different lines to cover the trip from their origin to the desired destination. As a consequence, the rel...
146
click to vote
SAT
2009
Springer
15 years 9 months ago
2009
Springer
Cryptography ensures the confidentiality and authenticity of information but often relies on unproven assumptions. SAT solvers are a powerful tool to test the hardness of certain ...
120
click to vote
GECCO
2010
Springer
15 years 7 months ago
2010
Springer
The Quadratic Assignment Problem (QAP) is a well-known NP-hard combinatorial optimization problem that is at the core of many real-world optimization problems. We prove that QAP c...
130
click to vote
IJAIT
2008
15 years 3 months ago
2008
Instruction scheduling is one of the most important steps for improving the performance of object code produced by a compiler. A fundamental problem that arises in instruction sch...