GNOM - Grup d'Optimització Numèrica i Modelització
El treball del grup comprèn l'optimització numèrica, la modelització de problemes resolubles amb optimització, i l'aplicació de tècniques adients a problemes de l'enginyeria, la indústria, la logística i les tecnologies de la informació. L'optimització numèrica inclou l'estudi de les propietats del problemes estudiats, l'anàlisi de nous algorismes d'optimització (lineal, no lineal, contínua, entera i combinatòria), el desenvolupament de procediments numèrics per a la seva implementació computacional eficient i la comparació amb algorismes previs, si existeixen. La part de modelització implica la cerca de formulacions escaients que permetin la resolució de problemes reals, sovint de gran dimensió. Els problemes reals en que el grup està treballant actualment són: protecció i privacitat de dades estadístiques; i generació òptima d'electricitat en un entorn multimercat.
The group works on both the numerical optimisation and the modelling of problems that can be solved through optimisation. Its work on numerical optimisation includes the analysis of new optimisation algorithms (linear, nonlinear, continuous and integer) and their convergence, the development of numerical procedures for their efficient computational implementation, and the comparison to existing algorithms. The work on modelling focuses on the solution of real problems, which are often large-scale, by finding an equivalentmathematical formulation leading to an optimisation problem, and applying a suitable solver, that has either been specially developed or is commercially available. The modelling languages that are available are used.
The group works on both the numerical optimisation and the modelling of problems that can be solved through optimisation. Its work on numerical optimisation includes the analysis of new optimisation algorithms (linear, nonlinear, continuous and integer) and their convergence, the development of numerical procedures for their efficient computational implementation, and the comparison to existing algorithms. The work on modelling focuses on the solution of real problems, which are often large-scale, by finding an equivalentmathematical formulation leading to an optimisation problem, and applying a suitable solver, that has either been specially developed or is commercially available. The modelling languages that are available are used.
Col·leccions
-
Articles de revista [67]
-
Reports de recerca [30]
-
Working papers [1]
Enviaments recents
-
A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks
(2019-01-28)
Report de recerca
Accés obertThe computation of the Newton direction is the most time consuming step of interior-point methods. This direction was efficiently computed by a combination of Cholesky factorizations and conjugate gradients in a specialized ... -
Exact calculation of network robustness
(2019-03)
Article
Accés restringit per política de l'editorialFinding the most critical nodes regarding network connectivity has attracted the attention of many researchers in infrastructure networks, power grids, transportation networks and physics in complex networks. Static ... -
A branch-and-cut algorithm for the multidepot rural postman problem
(2018-03)
Article
Accés obertThis paper considers the Multidepot Rural Postman Problem, an extension of the classical Rural Postman Problem in which there are several depots instead of only one. The aim is to construct a minimum cost set of routes ... -
Exact solution of hub network design problems with profits
(Elsevier, 2018-04-01)
Article
Accés restringit per política de l'editorialThis paper studies hub network design problems with profits. They consider a profit-oriented objective that measure the tradeoff between the revenue due to served commodities and the overall network design and transportation ... -
A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks
(2018-11)
Report de recerca
Accés obert -
Solving the optimum communication spanning tree problem
(Elsevier, 2019-02)
Article
Accés restringit per política de l'editorialThis paper presents an algorithm based on Benders decomposition to solve the optimum communication spanning tree problem. The algorithm integrates within a branch-and-cut framework a stronger reformulation of the problem, ... -
Assessing Shiny apps through student feedback: recommendations from a qualitative study
(2018-09)
Article
Accés restringit per política de l'editorialTeaching statistics has benefited from Java applets, the successful technology that appeared in the late 90s and which allowed real interactivity on an Internet browser. Combining dynamic functionality with the web provides ... -
A two-phase solution algorithm for the Flexible Periodic Vehicle Routing Problem
(2018-11-01)
Article
Accés restringit per política de l'editorialThe Flexible Periodic Vehicle Routing Problem is the problem of visiting a given set of customers considering a certain periodicity to attend their demands. It is a generalization of the Periodic Vehicle Routing Problem ... -
Symmetric vs asymmetric protection levels in SDC methods for tabular data
(Springer, 2018-09)
Article
Accés obertProtection levels on sensitive cells—which are key parameters of any statistical disclosure control method for tabular data—are related to the difficulty of any attacker to recompute a good estimation of the true cell ... -
On optimal participation in the electricity markets of wind power plants with battery energy storage systems
(2018-01-01)
Article
Accés obertThe recent cost reduction and technological advances in medium- to large-scale battery energy storage systems (BESS) makes these devices a true alternative for wind producers operating in electricity markets. Associating ... -
Analysis of satellite constellations for the continuous coverage of ground regions
(2017-11-01)
Article
Accés obertThis paper studies the problem of analyzing multisatellite constellations with respect to their coverage capacity of areas on Earth’s surface. The geometric configuration of constellation projection points on Earth’s surface ... -
A linear optimization based method for data privacy in statistical tabular data
(2017-05-23)
Report de recerca
Accés obertNational Statistical Agencies routinely disseminate large amounts of data. Prior to dissemination these data have to be protected to avoid releasing confidential information. Controlled tabular adjustment (CTA) is one of ...
RSS 1.0