Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Christian Blum
Information about the author Christian Blum will soon be added to the site.
Found
9 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Variable neighbourhood search for the variable sized bin packing problem
2012
The variable sized bin packing problem is a generalisation of the...
Large neighbourhood search algorithms for the founder sequence reconstruction problem
2012
The reconstruction of founder genetic sequences of a population is a relevant issue in...
Beam-ACO for Simple Assembly Line Balancing
2008
Assembly line balancing problems are concerned with the optimization of manufacturing...
Revisiting dynamic programming for finding optimal subtrees in trees
2007
In this paper we revisit an existing dynamic programming algorithm for finding optimal...
Finding edge-disjoint paths in networks: an ant colony optimization algorithm
2007
One of the basic operations in communication networks consists in establishing routes...
Finding edge-disjoint paths in networks: an ant colony optimization algorithm
2007
One of the basic operations in communication networks consists in establishing routes...
Beam-ACO – hybridizing ant colony optimization with beam search: an application to open shop scheduling
2005
Ant colony optimization (ACO) is a metaheuristic approach to tackle hard combinatorial...
New metaheuristic approaches for the edge-weighted k-cardinality tree problem
2005
In this paper we propose three metaheuristic approaches, namely a Tabu Search, an...
An ant colony optimization algorithm for shop scheduling problems
2004
We deal with the application of ant colony optimization to group shop scheduling,...
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers