4430 search results - page 73 / 886 » Solving Optimization Problems with DLL |
108
Voted
GECCO
2008
Springer
15 years 3 months ago
2008
Springer
This paper describes a multi-objective memetic approach for solving multi-objective flexible process sequencing problems in flexible manufacturing systems (FMSs). FMS can be des...
198
Voted
ICICIC
2006
IEEE
15 years 8 months ago
2006
IEEE
In timetable scheduling problems, examination subjects must be slotted to certain times that satisfy several of constraints. They are NP-completeness problems, which usually lead ...
104
Voted
SSWMC
2004
15 years 4 months ago
2004
We analyze the complexity of the steganography problem and show that the decision version of the problem is NP-complete through transformation from the Knapsack problem. We also g...
133
Voted
CEC
2009
IEEE
15 years 9 months ago
2009
IEEE
— In this paper, the performance assessment of the hybrid Archive-based Micro Genetic Algorithm (AMGA) on a set of bound-constrained synthetic test problems is reported. The hybr...
100
Voted
DISOPT
2007
15 years 2 months ago
2007
The job rotation problem (JRP) is the following: Given an n × n matrix A over R ∪ {−∞} and k ≤ n, find a k × k principal submatrix of A whose optimal assignment problem...