70 search results - page 2 / 14 » Hybrid Tabu Search for Lot Sizing Problems |
AIMSA
2008
Springer
14 years 1 months ago
2008
Springer
Abstract. The problem of curriculum-based course timetabling is studied in this work. In addition to formally defining the problem, we present a hybrid solution algorithm (Adaptiv...
INFORMATICALT
2006
13 years 7 months ago
2006
Given a set of objects with profits (any, even negative, numbers) assigned not only to separate objects but also to pairs of them, the unconstrained binary quadratic optimization p...
SEAL
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. This paper deals with the problem of nurse rostering in Belgian hospitals. This is a highly constrained real world problem that was (until the results of this research we...
HEURISTICS
2002
13 years 7 months ago
2002
Neighborhood search heuristics like local search and its variants are some of the most popular approaches to solve discrete optimization problems of moderate to large size. Apart ...
ANOR
2011
13 years 2 months ago
2011
Abstract The problem of finding a global optimum of an unconstrained multimodal function has been the subject of intensive study in recent years, giving rise to valuable advances ...