• A branch-and-price algorithm for the Aperiodic Multi-Period Service Scheduling Problem 

      Fernández Aréizaga, Elena; Kalcsics, Jörg; Núñez del Toro, Alma Cristina (Elsevier, 2017-12-16)
      Article
      Accés obert
      This paper considers the multi-period service scheduling problem with an aperiodic service policy. In this problem, a set of customers who periodically require service over a finite time horizon is given. To satisfy the ...
    • An algorithm for the microaggregation problem using column generation 

      Castro Pérez, Jordi; Gentile, Claudio; Spagnolo Arrizabalaga, Enric (2022-08-01)
      Article
      Accés obert
      The field of statistical disclosure control aims to reduce the risk of re-identifying an individual from disseminated data, a major concern among national statistical agencies. Operations Research (OR) techniques have been ...
    • An algorithm for the microaggregation problem using column generation 

      Gentile, Claudio; Spagnolo Arrizabalaga, Enric; Castro Pérez, Jordi (2020-06)
      Report de recerca
      Accés obert
      The field of Statistical Disclosure Control aims at reducing the risk of re-identification of an individualwhen disseminating data, and it is one of the main concerns of national statistical agencies. OperationsResearch ...
    • An optimization-based decomposition heuristic for the microaggregation problem 

      Castro Pérez, Jordi; Gentile, Claudio; Spagnolo Arrizabalaga, Enrique (Springer, 2022)
      Text en actes de congrés
      Accés obert
      Given a set of points, the microaggregation problem aims to find a clustering with a minimum sum of squared errors (SSE), where the cardinality of each cluster is greater than or equal to k. Points in the cluster are ...
    • Column generation algorithm for RSA problems in flexgrid optical networks 

      Ruiz Ramírez, Marc; Pioro, Michal; Zotkiewicz, Mateusz; Klinkowski, Miroslaw; Velasco Esteban, Luis Domingo (2013-10)
      Article
      Accés restringit per política de l'editorial
      Finding optimal routes and spectrum allocation in flexgrid optical networks, known as the RSA problem, is an important design problem in transport communication networks. The problem is TeX -hard, and its intractability ...
    • Column-generation and interior point methods applied to the long-term electric power-planning problem 

      Pagès Bernaus, Adela (Universitat Politècnica de Catalunya, 2006-12-18)
      Tesi
      Accés obert
      Aquesta tesi s'adreça al problema de planificació de la generació elèctrica a llarg termini per a una companyia específica (SGC) que participa en un mercat liberalitzat organitzat en un pool. Els objectius de la tesi són: ...
    • Reoptimization of dynamic flexgrid optical networks after link failure repairs 

      Zotkiewicz, Mateusz; Ruiz Ramírez, Marc; Klinkowski, Miroslaw; Pioro, Michal; Velasco Esteban, Luis Domingo (Institute of Electrical and Electronics Engineers (IEEE), 2015-01-01)
      Article
      Accés obert
      In dynamic flexgrid optical networks, the usage of capacity may not be optimal due to the permanent process of setting up and tearing down connections, which, if not controlled, leads to spectrum fragmentation and, as a ...
    • Scheduling policies for multi-period services 

      Núñez del Toro, Alma Cristina (Universitat Politècnica de Catalunya, 2016-02-02)
      Tesi
      Accés obert
      In many situations, the resources in organizations are employed to satisfy some demand (or services) requirements, which are repeated with some periodicity. These recurrent services appear in a large variety of processes ...
    • Valid inequalities for the routing and spectrum allocation problem in elastic optical networks 

      Klinkowski, Miroslaw; Pioro, Michal; Zotkiewicz, Mateusz; Ruiz Ramírez, Marc; Velasco Esteban, Luis Domingo (Institute of Electrical and Electronics Engineers (IEEE), 2014)
      Text en actes de congrés
      Accés restringit per política de l'editorial
      We deal with a natural integer-linear programming formulation of the routing and spectrum allocation (RSA) problem in elastic optical networks. We focus on strengthening the formulation with valid inequalities (cuts). For ...