1328 search results - page 9 / 266 » An Optimization Algorithm for the Ordered Open-End Bin-Packi... |
121
click to vote
GECCO
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. A hybrid genetic algorithm is proposed for the sequential ordering problem. It is known that the performance of a genetic algorithm depends on the survival environment an...
150
click to vote
ISAAC
1993
Springer
15 years 7 months ago
1993
Springer
A binary decision diagram (BDD) is a directed acyclic graph for representing a Boolean function. BDD’s are widely used in various areas which require Boolean function manipulatio...
142
click to vote
GECCO
2003
Springer
15 years 8 months ago
2003
Springer
The Linear Ordering Problem(LOP), which is a well-known NP-hard problem, has numerous applications in various fields. Using this problem as an example, we illustrate a general pro...
138
click to vote
COCOA
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
164
click to vote
COCOA
2008
Springer
15 years 4 months ago
2008
Springer
We introduce a new combinatorial optimization problem, which is a generalization of the Traveling Salesman Problem (TSP) and which we call Traveling Salesman Problem of Second Orde...