Browsing by Author "Blum, Christian"

A probabilistic beam search approach to the shortest common supersequence problem
Blum, Christian; Cotta, C.; Fernández, Antonio J.; Gallardo, Francisco (200611)
External research report
Open AccessThe Shortest Common Supersequence Problem (SCSP) is a wellknown hard combinatorial optimization problem that formalizes many real world problems. This paper presents a novel randomized search strategy, called probabilistic ... 
BeamACO for the travelling salesman problem with time windows
López Ibáñez, Manuel; Blum, Christian (200907)
External research report
Open AccessThe travelling salesman problem with time windows is a difficult optimization problem that arises, for example, in logistics. This paper deals with the minimization of the travel cost. For solving this problem, this paper ... 
Can frogs find large independent sets in a decentralized way? Yes they can!
Blum, Christian; Blesa Aguilera, Maria Josep; Calvo, Borja (Springer, 2014)
Conference report
Open AccessThe problem of identifying a maximal independent (node) set in a given graph is a fundamental problem in distributed computing. It has numerous applications, for example, in wireless networks in the context of facility ... 
FrogCOL and FrogMIS: new decentralized algorithms for finding large independent sets in graphs
Blum, Christian; Calvo, Borja; Blesa Aguilera, Maria Josep (20150901)
Article
Restricted access  publisher's policyFinding large (and generally maximal) independent sets of vertices in a given graph is a fundamental problem in distributed computing. Applications include, for example, facility location and backbone formation in wireless ... 
Iterative beam search for simple assembly line balancing with a fixed number of work stations
Blum, Christian (201003)
External research report
Open AccessThe simple assembly line balancing problem (SALBP) concerns the assignment of tasks with predefined processing times to work stations that are arranged in a line. Hereby, precedence constraints between the tasks must be ... 
On solving the assembly line worker assignment and balancing problem via beam search
Blum, Christian; Miralles, Cristobal (201001)
External research report
Open AccessCertain types of manufacturing processes can be modelled by assembly line balancing problems. In this work we deal with a specific assembly line balancing problem that is know as the assembly line worker assignment and ... 
On solving the most strings with few bad columns problem: An ILP model and heuristics
Lizárraga Olivas, Evelia; Blesa Aguilera, Maria Josep; Blum, Christian; Raidl, Günther (Institute of Electrical and Electronics Engineers (IEEE), 2015)
Conference lecture
Open AccessThe most strings with few bad columns problem is an NPhard combinatorial optimization problem from the bioinformatics field. This paper presents the first integer linear programming model for this problem. Moreover, a ...