Browsing by Author "Blum, Christian"
Now showing items 2140 of 56

BeamACO for the repetitionfree longest common subsequence problem
Blum, Christian; Blesa Aguilera, Maria Josep; Calvo, Borja (2013)
Conference report
Restricted access  publisher's policyIn this paper we propose a BeamACO approach for a combinatorial optimization problem known as the repetitionfree longest common subsequence problem. Given two input sequences x and y over a finite alphabet S, this problem ... 
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 ... 
Combining ant colony optimization with dynamic programming for solving the kcardinality tree problem
Blum, Christian; Blesa Aguilera, Maria Josep (200504)
External research report
Open AccessResearch efforts in metaheuristics have shown that an intelligent incorporation of more classical optimization techniques in metaheuristics can be very beneficial. In this paper, we combine the metaheuristic ant colony ... 
Construct, merge, solve and adapt versus large neighborhood search for solving the multidimensional Knapsack problem: Which one works better when?
Lizárraga Olivas, Evelia; Blesa Aguilera, Maria Josep; Blum, Christian (Springer, 2017)
Conference lecture
Open AccessBoth, Construct, Merge, Solve and Adapt (CMSA) and Large Neighborhood Search (LNS), are hybrid algorithms that are based on iteratively solving subinstances of the original problem instances, if possible, to optimality. ... 
Construct, Merge, Solve and Adapt: Application to the repetitionfree longest common subsequence problem
Blum, Christian; Blesa Aguilera, Maria Josep (201603)
Article
Open AccessIn this paper we present the application of a recently proposed, general, algorithm for combinatorial optimization to the repetitionfree longest common subsequence problem. The applied algorithm, which is labelled Construct, ... 
Designing linear binary block codes: Constructive heuristics and iterated local search
Blum, Christian (200511)
External research report
Open AccessError correcting codes such as linear binary block codes (LBBCs) play an important role, for example, in the transmission of messages over telecommunication networks, or in reading information from digital data media such ... 
Distributed graph coloring in wireless ad hoc networks: a lightweight algorithm based on Japanese tree frogs' calling behaviour
Hernández Pibernat, Hugo; Blum, Christian (IEEE, 2011)
Conference report
Restricted access  publisher's policyGraph coloring concerns the problem of assigning colors to the nodes of a graph such that adjacent nodes do not share the same color. In this paper we deal with the problem of finding valid colorings of graphs in a distributed ... 
Finding edgedisjoint paths in networks by means of artificial ant colonies
Blesa Aguilera, Maria Josep; Blum, Christian (200701)
External research report
Open AccessOne of the basic operations in communication networks consists in establishing routes for connection requests between physically separated network nodes. In many situations, either due to technical constraints or to ... 
Finding edgedisjoint paths with artificial ant colonies
Blesa Aguilera, Maria Josep; Blum, Christian (200504)
External research report
Open AccessOne of the basic operations in communication networks consists in establishing routes for connection requests between physically separated network nodes. In many situations, either due to technical constraints or to ... 
Foundations of ANTCYCLE: selfsynchronized dutycycling in mobile sensor networks
Hernández Pibernat, Hugo; Blum, Christian (Wiley Heyden, 201109)
Article
Restricted access  publisher's policyAnts are generally believed to follow an intensive work routine. Numerous tales and fables refer to ants as conscientious workers. Nevertheless, biologists have discovered that ants also rest for extended periods of time. ... 
FrogCOL and FrogMIS: new decentralized algorithms for finding large independent sets in graphs
Blum, Christian; Calvo, Borja; Blesa Aguilera, Maria Josep (20150901)
Article
Open AccessFinding 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 ... 
Hybrid algorithms for the variable sized bin packing problem
Blum, Christian; Hemmelmayr, Vera C.; Hernández Pibernat, Hugo; Schmid, Verena (201010)
Article
Restricted access  publisher's policyThis paper deals with the socalled variable sized bin packing problem, which is a generalization of the onedimensional bin packing problem in which a set of items with given weights have to be packed into a minimumcost ... 
Hybrid metaheuristics in combinatorial optimization: A survey
Blum, Christian; Puchinger, Jakob; Raidl, Günther; Roli, Andrea (201109)
Article
Restricted access  publisher's policyResearch in metaheuristics for combinatorial optimization problems has lately experienced a noteworthy shift towards the hybridization of metaheuristics with other techniques for optimization. At the same time, the focus ... 
Hybrid techniques based on solving reduced problem instances for a longest common subsequence problem
Blum, Christian; Blesa Aguilera, Maria Josep (20180101)
Article
Open AccessFinding the longest common subsequence of a given set of input strings is a relevant problem arising in various practical settings. One of these problems is the socalled longest arcpreserving common subsequence problem. ... 
Hybridizing BeamACO with constraint programming for single machine job scheduling
Thiruvady, Dhananjay; Blum, Christian; Meyer, Bernd; Ernst, Andreas T. (2009)
Article
Restricted access  publisher's policyA recent line of research concerns the integration of ant colony optimization and constraint programming. Hereby, constraint programming is used for eliminating parts of the search tree during the solution construction of ... 
Iterated greedy algorithms for the maximal covering location problem
Rodríguez, Francisco J.; Blum, Christian; Lozano, Manuel; García Martínez, Carlos (2012)
Article
Restricted access  publisher's policyThe problem of allocating a set of facilities in order to maximise the sum of the demands of the covered clients is known as the maximal covering location problem. In this work we tackle this problem by means of iterated ... 
Iterative beam search for simple assembly line balancing with a fixed number of work stations
Blum, Christian (Institut d'Estadística de Catalunya, 2011)
Article
Open AccessThe simple assembly line balancing problem (SALBP) concern s the assignment of tasks with predefined processing times to work stations that are arran ged in a line. Hereby, precedence constraints between the tasks ... 
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 ... 
Large neighborhood search for the most strings with few bad columns problem
Lizárraga Olivas, Evelia; Blesa Aguilera, Maria Josep; Blum, Christian; Raidl, Günther (Springer, 20161006)
Article
Open AccessIn this work, we consider the following NPhard combinatorial optimization problem from computational biology. Given a set of input strings of equal length, the goal is to identify a maximum cardinality subset of strings ...