Now showing items 21-38 of 38

    • Hybrid techniques based on solving reduced problem instances for a longest common subsequence problem 

      Blum, Christian; Blesa Aguilera, Maria Josep (2018-01-01)
      Article
      Open Access
      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. ...
    • Implementation of a GFDM scheme for a high mobility scenario on a 5G simulator including parameter optimization 

      Heinrich Mas, Guillem (Universitat Politècnica de Catalunya, 2017-09-06)
      Bachelor thesis
      Open Access
      Covenantee:   Technische Universität Wien
      The fifth generation of mobiles communications (5G) requires a variety of applications that the fourth generation (4G) cannot achieve, such as a higher data rate, ultra-low power consumption and short response times. In ...
    • Lagrangean bounds for the optimum communication spanning tree problem 

      Contreras, I.; Fernández Aréizaga, Elena; Marín, Alfredo (Springer Verlag, 2010)
      Article
      Restricted access - publisher's policy
      This paper considers the Optimum Communication Spanning Tree Problem. An integer programming formulation that yields tight LP bounds is proposed. Given that the computational effort required to obtain the LP bounds ...
    • Metaheurísticas aplicadas al problema QAP. Estudio y experiencia computacional. 

      Sarria Cerro, Víctor Manuel (Universitat Politècnica de Catalunya, 2010-09)
      Master thesis (pre-Bologna period)
      Open Access
      Este proyecto se ha concebido como el estudio de diferentes metaheurísticas aplicadas al problema de asignación cuadrática conocido por sus siglas en inglés QAP. El problema QAP es un problema tipo NP-Hard ya que no existe ...
    • Mòdul d'assignació i routing d'un sistema de transport a la demanda 

      Recio Domènech, Gonzalo (Universitat Politècnica de Catalunya, 2019-01-29)
      Bachelor thesis
      Open Access
      Es presenta una metaheurística basada en una Cerca Tabú per a resoldre el Pickup and Delivery Problem with Time Windows que s'utilitzarà en un sistema per a optimitzar les rutes d'un servei de taxis per a persones amb ...
    • New computational experiences on the Hoist Scheduling Problem for cyclic manufacturing of different products. 

      Mateo Doll, Manuel; Companys Pascual, Ramón (2007-01)
      External research report
      Open Access
      Jobs of two products must receive the same treatments in a production line of tanks. If the size of both batches is equal, we propose a cyclic manufacturing composed of a job from batch 1 and a job from batch 2. A hoist ...
    • Optimització combinatòria intel·ligent per a problemes d'enrutament 

      Casasayas Esquerda, Pol (Universitat Politècnica de Catalunya, 2019-10-17)
      Bachelor thesis
      Restricted access - confidentiality agreement
    • Optimització de xarxes a partir del grau d'intermediació dels enllaços 

      Gallegos Cervilla, Rubén (Universitat Politècnica de Catalunya, 2011-09-07)
      Master thesis (pre-Bologna period)
      Open Access
      English: In this project we study the optimization of a complex network based on the geographical length of the links and the number of geodesic paths that go through them (edge betweenness). By considering relevant ...
    • Plataforma de optimización combinatoria como un servicio 

      Pinto Quinto, Cristian Miguel (Universitat Politècnica de Catalunya, 2016-06)
      Bachelor thesis
      Restricted access - confidentiality agreement
    • Predicció i optimització en fantasy sports 

      Bel Roig, Joan Francesc (Universitat Politècnica de Catalunya, 2016-10)
      Master thesis (pre-Bologna period)
      Open Access
      Daily fantasy Sports are popular betting online multiplayer contests consisting in the confection of a virtual lineup of elite athletes observing specific restrictions. The scores are computed from the performance of the ...
    • Reconstrucció de grafs a partir del grau d'intermediació (betweenness) dels seus vèrtex 

      Paz Sánchez, Juan (Universitat Politècnica de Catalunya, 2007-07-05)
      Master thesis (pre-Bologna period)
      Open Access
    • Reformulated acyclic partitioning for rail-rail containers transshipment 

      Albareda Sambola, Maria; Marín Pérez, Alfredo; Rodríguez Chía, Antonio Manuel (Elsevier, 2019-08-16)
      Article
      Restricted access - publisher's policy
      Many rail terminals have loading areas that are properly equipped to move containers between trains. With the growing throughput of these terminals all the trains involved in a sequence of such movements may not ¿t in the ...
    • Residual-guided look-ahead in AND/OR search for graphical models 

      Lam, William; Kask, Kalev; Larrosa Bondia, Francisco Javier; Dechter, Rina (2017-10-01)
      Article
      Open Access
      We introduce the concept of local bucket error for the mini-bucket heuristics and show how it can be used to improve the power of AND/OR search for combinatorial optimization tasks in graphical models (e.g. MAP/MPE or ...
    • Solving the generalized apportionment problem through the optimization of discrepancy functions 

      Bautista Valhondo, Joaquín; Companys Pascual, Ramón; Corominas Subias, Albert (Elsevier, 2001-04)
      Article
      Open Access
      One of the ways to solve the classical apportionment problem (which has been studied chiefly in relation to the apportionment of seats in a chamber of representatives) is the optimization of a discrepancy function; although ...
    • Subgrafs d'energia mínima en xarxes ad-hoc 

      Rodríguez Viaplana, Albert; Aymamí Gili, Eva (Universitat Politècnica de Catalunya, 2008-01-23)
      Master thesis (pre-Bologna period)
      Open Access
      En una xarxa de comunicacions ad-hoc els diferents nodes són normalment dispositius sense fils que poden situar-se sobre qualsevol punt de l’espai. En aquest tipus de xarxes s’ha de definir els enllaços entre els ...
    • Subproblem ordering heuristics for AND/OR best-first search 

      Lam, William; Kask, Kalev; Larrosa Bondia, Francisco Javier; Dechter, Rina (2017-11-09)
      Article
      Open Access
      Best-first search can be regarded as anytime scheme for producing lower bounds on the optimal solution, a characteristic that is mostly overlooked. We explore this topic in the context of AND/OR best-first search, guided ...
    • Task Packing: Efficient task scheduling in unbalanced parallel programs to maximize CPU utilization 

      Utrera Iglesias, Gladys Miriam; Farreras Esclusa, Montse; Fornés de Juan, Jordi (Elsevier, 2019-12)
      Article
      Restricted access - publisher's policy
      Load imbalance in parallel systems can be generated by external factors to the currently running applications like operating system noise or the underlying hardware like a heterogeneous cluster. HPC applications working ...
    • Variations in the efficiency of a mathematical programming solver according to the order of the constraints in the model 

      Pastor Moreno, Rafael (School of Industrial and Aeronautic Engineering of Terrassa (ETSEIAT). Universitat Politècnica de Catalunya (UPC), 2008-12)
      Article
      Open Access
      It is well-known that the efficiency of mixed integer linear mathematical programming depends on the model (formulation) used. With the same mathematical programming solver, a given problem can be solved in a brief calculation ...