Ara es mostren els items 32-51 de 60

    • Finding edge-disjoint paths in networks by means of artificial ant colonies 

      Blesa Aguilera, Maria Josep; Blum, Christian (2007-01)
      Report de recerca
      Accés obert
      One 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 edge-disjoint paths with artificial ant colonies 

      Blesa Aguilera, Maria Josep; Blum, Christian (2005-04)
      Report de recerca
      Accés obert
      One 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: self-synchronized duty-cycling in mobile sensor networks 

      Hernández Pibernat, Hugo; Blum, Christian (Wiley Heyden, 2011-09)
      Article
      Accés restringit per política de l'editorial
      Ants 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 (2015-09-01)
      Article
      Accés obert
      Finding 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 (2010-10)
      Article
      Accés restringit per política de l'editorial
      This paper deals with the so-called variable sized bin packing problem, which is a generalization of the one-dimensional bin packing problem in which a set of items with given weights have to be packed into a minimum-cost ...
    • Hybrid metaheuristics in combinatorial optimization: A survey 

      Blum, Christian; Puchinger, Jakob; Raidl, Günther; Roli, Andrea (2011-09)
      Article
      Accés restringit per política de l'editorial
      Research 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 (2018-01-01)
      Article
      Accés obert
      Finding 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 so-called longest arc-preserving common subsequence problem. ...
    • Hybridizing Beam-ACO with constraint programming for single machine job scheduling 

      Thiruvady, Dhananjay; Blum, Christian; Meyer, Bernd; Ernst, Andreas T. (2009)
      Article
      Accés restringit per política de l'editorial
      A 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
      Accés restringit per política de l'editorial
      The 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 (2010-03)
      Report de recerca
      Accés obert
      The simple assembly line balancing problem (SALBP) concerns the assignment of tasks with pre-defined processing times to work stations that are arranged in a line. Hereby, precedence constraints between the tasks must be ...
    • 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
      Accés obert
      The simple assembly line balancing problem (SALBP) concern s the assignment of tasks with pre-defined processing times to work stations that are arran ged in a line. Hereby, precedence constraints between the tasks ...
    • 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, 2016-10-06)
      Article
      Accés obert
      In this work, we consider the following NP-hard 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 ...
    • Large neighbourhood search algorithms for the founder sequence reconstruction problem 

      Roli, Andrea; Benedettini, Stefano; Stützle, Thomas; Blum, Christian (2012-02)
      Article
      Accés restringit per política de l'editorial
      The reconstruction of founder genetic sequences of a population is a relevant issue in evolutionary biology research. The problem consists in finding a biologically plausible set of genetic sequences (founders), which can ...
    • Metaheuristics for the edge-weighted K-cardinality tree problem 

      Blum, Christian; Blesa Aguilera, Maria Josep (2003-01)
      Report de recerca
      Accés obert
      Metaheuristics are successful algorithmic concepts to tackle extit{NP}-hard combinatorial optimization problems. In this paper we deal with metaheuristics for the K-cardinality tree (KCT) problem in edge-weighted graphs. ...
    • Negative learning ant colony optimization for network alignment 

      Rodríguez Corominas, Guillem; Blum, Christian; Blesa Aguilera, Maria Josep (Association for Computing Machinery (ACM), 2022)
      Text en actes de congrés
      Accés obert
      The Network Alignment problem is a hard Combinatorial Optimization problem with a wide range of applications, especially in computational biology. Given two (or more) networks, the goal is to find a mapping between their ...
    • New algorithms for DNA sequencing by hybridization 

      Blum, Christian; Yábar Vallès, Mateu; Blesa Aguilera, Maria Josep (2006-12)
      Report de recerca
      Accés obert
      The reconstruction of DNA sequences from DNA fragments is one of the most challenging problems in computational biology. In recent years the specific problem of DNA sequencing by hybridization has attracted quite a lot of ...
    • New constructive heuristics for DNA sequencing by hybridization 

      Blum, Christian; Yábar Vallès, Mateu (2006-05)
      Report de recerca
      Accés obert
      Deoxyribonucleic acid (DNA) is a molecule that consists of two complementary sequences of amino acids. Reading these sequences is an important task in biology, called DNA sequencing. However, large DNA molecules cannot be ...
    • On solving the assembly line worker assignment and balancing problem via beam search 

      Blum, Christian; Miralles, Cristobal (2010-01)
      Report de recerca
      Accés obert
      Certain 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)
      Comunicació de congrés
      Accés obert
      The most strings with few bad columns problem is an NP-hard combinatorial optimization problem from the bioinformatics field. This paper presents the first integer linear programming model for this problem. Moreover, a ...
    • On the use of primal and dual knowledge in randomized constructive optimization algorithms 

      Mastrolilli, Monaldo; Blum, Christian (2006-12)
      Report de recerca
      Accés obert
      Many approximate heuristics for optimization are either based on neighborhood search or on the construction of solutions. Examples for the latter ones include ant colony optimization and greedy randomized adaptive search ...